A Finite State and Data-Oriented Method for Grapheme to Phoneme Conversion
Gosse Bouma
Abstract
A finite-state method, based on leftmost longest-match replacement, is presented for segmenting words into graphemes, and for converting graphemes into phonemes. A small set of hand-crafted conversion rules for Dutch achieves a phoneme accuracy of over 93%. The accuracy of the system is further improved by using transformation-based learning. The phoneme accuracy of the best system (using a large set of rule templates and a `lazy' variant of Brill's algoritm), trained on only 40K words, reaches 99% accuracy.
Create a lesson
Related papers
RSI-Anything: Unlocking Recursive Self-Improvement with World Models
Taoyong Cui, Pinxian Zeng, Wanghan Xu et al.
When VLMs Destroy What They Know: Spatial Representations Fall Below Lexical Priors
Shubh Garg, Chen Shani
Structural Automata for Neural Semantic Parsing
Xiao Zhang
Task Context Shapes Component Roles in Language Models
Sovesh Mohapatra, Dani S Bassett
Can Language Models Learn When to Abstain? Policy Learning and Calibrated Answer Selection
Juan Terven, Diana-Margarita Córdova-Esparza, Ruben Gomez et al.
Error Rate is Not Enough: Costs of Augmentation in Low-Resource ASR
Katsumi Ibaraki, David Chiang