About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
INTERSPEECH - Eurospeech 1991
Conference paper
A BI-DIRECTIONAL MODEL OF ENGLISH PRONUNCIATION
Abstract
The two tasks of finding the pronunciation of a word from its spelling, and the spelling from its pronunciation, are basic problems in speech synthesis and recognition respectively. A related problem is how best to align the phonemic and orthographic representations of a given word to show the correspondence between each of the letters in the word and the sounds to which they belong. The finding of one form of a word when observing only the other form, is likened to decoding an encrypted message to find a hidden meaning. If a Hidden Markov Model (HMM) is assumed to generate the observed form of the word from its hidden form, then a method exists to solve the alignment problem, provided that the parameters of the model are known. Since they are in general not accurately known, a training algorithm, such as the Forward-Backward (maximum-likelihood) method can be used to determine a good estimate for them. A simple HMM for solving the two decoding tasks is suggested, and the results of training it on real data are discussed. The use of a single methodology to solve two different but related tasks is offered as an example for other language tasks.