Speaker adaptation for a hidden Markov model
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11, 2667-2670
- https://doi.org/10.1109/icassp.1986.1168680
Abstract
During the training process, parameters of an HMM (hidden Markov model) are calculated iteratively using "Forward-Backward algorithm." The adaptation method we propose in this paper uses the intermediate results of the last iteration. The amount of storage to keep intermediate results is very small (typically 1/400) compared with that of the entire parameters. The confidence measure of the initial training and adaptive training can be reflected to the coefficients in calculating new parameters. Experiments were done on A. the same speaker several months between training and adaptive training/decoding B. different speakers In the case of the same speaker the recognition errors were reduced by 1/2 to 2/3 compared with non-adaptation case. However, for different speakers, only a slight improvement were obtained.Keywords
This publication has 3 references indexed in Scilit:
- Isolated word recognition using hidden Markov modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A Maximum Likelihood Approach to Continuous Speech RecognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecologyBulletin of the American Mathematical Society, 1967