ISCA Archive Interspeech 2005
ISCA Archive Interspeech 2005

Hidden Markov models for grapheme to phoneme conversion

Paul Taylor

We propose a method for determining the canonical phonemic transcription of a word from its orthography using hidden Markov models. In the model, phonemes are the hidden states and graphemes the observations. Apart from one pre-processing step, the model is fully automatic. The paper describes the basic HMM framework and enhancements which use pre-processing, context dependent models and a syllable level stress model. In all cases the power of the framework lies in that training of the models (which includes alignment of graphemes and phonemes, training of transitions and training observation probabilities) is performed in a single step.


doi: 10.21437/Interspeech.2005-615

Cite as: Taylor, P. (2005) Hidden Markov models for grapheme to phoneme conversion. Proc. Interspeech 2005, 1973-1976, doi: 10.21437/Interspeech.2005-615

@inproceedings{taylor05_interspeech,
  author={Paul Taylor},
  title={{Hidden Markov models for grapheme to phoneme conversion}},
  year=2005,
  booktitle={Proc. Interspeech 2005},
  pages={1973--1976},
  doi={10.21437/Interspeech.2005-615}
}