Hidden Markov Models for Speech Recognition
B.-H. Juang, L. R. Rabiner · Technometrics · 1991
The use of hidden Markov models for speech recognition has become predominant in the last several years, as evidenced by the number of published papers and talks at major speech conferences. The reasons this method has become so popular are the inherent statistical (mathematically precise) framework; the ease and availability of training algorithms for cstimating the parameters of the models from finite training sets of speech data; the flexibility of the resulting recognition system in which one can easily change the size, type, or architecture of the models to suit particular words, sounds, and so forth; and the ease of implementation of the overall recognition system. In this expository article, we address the role of statistical methods in this powerful technology as applied to speech recognition and discuss a range of theoretical and practical issues that are as yet unsolved in terms of their importance and their effect on performance for different system implementations.
Cited by 1,068 works. doi:10.1080/00401706.1991.10484833
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Pattern classification and scene analysis
- Classification and Regression Trees.
- A tutorial on hidden Markov models and selected applications in speech recognition
- Information theory and statistics
- The viterbi algorithm
- An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process
- An Algorithm for Vector Quantizer Design
- A Maximum Likelihood Approach to Continuous Speech Recognition
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains