A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition

Proceedings of the IEEE

Volumn 77, Issue 2, 1989, Pages 257-286

  Rabiner, Lawrence R ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY--RANDOM PROCESSES;

DISCRETE MARKOV CHAINS; HIDDEN MARKOV MODELS; ISOLATED WORD SPEECH RECOGNIZER;

SPEECH;

EID: 0024610919     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.18626     Document Type: Article

References (66)

1. L. E. Baum and T. Petrie, “Statistical inference for probabilistic functions of finite state Markov chains,” Ann. Math. Stat., vol. 37, pp. 1554-1563, 1966.
2. L. E. Baum and J. A. Egon, “An inequality with applications to statistical estimation for probabilistic functions of a Markov process and to a model for ecology,” Bull. Amer. Meteorol. Soc., vol. 73, pp. 360-363, 1967.
3. L. E. Baum and G. R. Sell, “Growth functions for transformations on manifolds,” Pac. J. Math., vol. 27, no. 2, pp. 211-227, 1968.
4. L. E. Baum, T. Petrie, G. Soules, and N. Weiss, “A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains,” Ann. Math. Stat., vol. 41, no. 1, pp. 164-171, 1970.
5. L. E. Baum, “An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes,” Inequalities, vol. 3, pp. 1-8, 1972.
6. J. K. Baker, “The dragon system—An overview,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-23, no. 1, pp. 24-29, Feb. 1975.
7. F. Jelinek, “A fast sequential decoding algorithm using a stack,” IBM J. Res. Develop., vol. 13, pp. 675-685, 1969.
8. L. R. Bahl and F. Jelinek, “Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition,” IEEE Trans. Informat. Theory, vol. IT-21, pp. 404-411, 1975.
9. F. Jelinek, L. R. Bahl, and R. L. Mercer, “Design of a linguistic statistical decoder for the recognition of continuous speech,” IEEE Trans. Informat. Theory, vol. IT-21, pp. 250-256, 1975.
10. F. Jelinek, “Continuous speech recognition by statistical methods,” Proc. IEEE, vol. 64, pp. 532-536, Apr. 1976.
11. R. Bakis, “Continuous speech word recognition via centisecond acoustic states,” in Proc. ASA Meeting (Washington, DC), Apr. 1976.
12. F. Jelinek, L. R. Bahl, and R. L. Mercer, “Continuous speech recognition: Statistical methods,” in Handbook of Statistics, II, P. R. Krishnaiad, Ed. Amsterdam,The Netherlands: North-Holland, 1982.
13. L. R. Bahl, F. Jelinek, and R. L.Mercer, “Amaximum likelihood approach to continuous speech recognition,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, pp. 179-190, 1983.
14. S. E. Levinson, L. R. Rabiner, and M. M. Sondhi, “An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition,” Bell Syst. Tech. J., vol. 62, no. 4, pp. 1035-1074, Apr. 1983.
15. B. H. Juang, “On the hidden Markov model and dynamic time warping for speech recognition—A unified view,” AT&T Tech.]., vol. 63, no. 7, pp. 1213-1243, Sept. 1984.
16. L. R. Rabiner and B. H. Juang, “An introduction to hidden Markov models,” IEEE ASSP Mag., vol. 3, no. 1, pp. 4-16, 1986.
17. J. S. Bridle, “Stochastic models and template matching: Some important relationships between two apparently different techniques for automatic speech recognition,” in Proc. Inst. of Acoustics, Autum Conf., pp. 1-8, Nov. 1984.
18. J. Makhoul, S. Roucos, and H. Gish, “Vector quantization in speech coding,” Proc. IEEE, vol. 73, no. 11, pp. 1551-1588, Nov. 1985.
19. S. E. Levinson, “Structural methods in automatic speech recognition,” Proc. IEEE, vol. 73, no. 11, pp. 1625-1650, Nov. 1985.
20. A. W. Drake, “Discrete—state Markov processes,” Chapter 5 in Fundamentals of Applied Probability Theory. New York, NY: McGraw-Hill, 1967.
21. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimal decoding algorithm,” IEEE Trans. Informat. Theory, vol. IT-13, pp. 260-269, Apr. 1967.
22. G. D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973.
23. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” J. Roy. Stat. Soc, vol. 39, no. 1, pp. 1-38, 1977.
24. L. A. Liporace, “Maximum likelihood estimation for multivariate observations of Markov sources,” IEEE Trans. Informal Theory, vol. IT-28, no. 5, pp. 729-734, 1982.
25. B. H. Juang, “Maximum likelihood estimation for mixture multivariate stochastic observations of Markov chains,” AT&T Tech.]., vol. 64, no. 6, pp. 1235-1249, July-Aug. 1985.
26. B. H. Juang, S. E. Levinson, and M. M. Sondhi, “Maximum likelihood estimation for multivariate mixture observations of Markov chains,” IEEE Trans. Informat. Theory, vol. IT-32, no. 2, pp. 307-309, Mar. 1986.
27. A. B. Poritz, “Linear predictive hidden Markov models and the speech signal,” in Proc. ICASSP ′82 (Paris, France), pp. 1291-1294, May 1982.
28. B. H. Juang and L. R. Rabiner, “Mixture autoregressive hidden Markov models for speech signals,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-33, no. 6, pp. 1404-1413, Dec. 1985.
29. M. J. Russell and R. K. Moore, “Explicit modeling of state occupancy in hidden Markov models for automatic speech recognition,” in Proc. ICASSP ′85 (Tampa, FL), pp. 5-8, Mar. 1985.
30. S. E. Levinson, “Continuously variable duration hidden Markov models for automatic speech recognition,” Computer, Speech and Language, vol. 1, no. 1, pp. 29-45, Mar. 1986.
31. B. Lowerre and R. Reddy, “The HARPY speech understanding system,” in Trends in Speech Recognition, W. Lea, Editor. Englewood Cliffs, NJ: Prentice-Hall, 1980, pp. 340-346.
32. L. R. Bahl, P. F. Brown, P. V. de Souza, and R. L. Mercer, “Maximum mutual information estimation of hidden Markov model parameters for speech recognition,” in Proc. ICASSP ′86 (Tokyo, Japan), pp. 49-52, Apr. 1986.
33. Y. Ephraim, A. Dembo, and L. R. Rabiner, “A minimum discrimination information approach for hidden Markov modeling,” in Proc. ICASSP ′87 (Dallas, TX), Apr. 1987.
34. B. H. Juang and L. R. Rabiner, “A probabilistic distance measure for hidden Markov models,” AT&T Tech.]., vol. 64, no. 2, pp. 391-408, Feb. 1985.
35. L. R. Rabiner, B. H. Juang, S. E. Levinson, and M. M. Sondhi, “Some properties of continuous hidden Markov model representations,” AT&T Tech.J., vol. 64, no. 6, pp. 1251-1270, July-Aug. 1985.
36. F. Jelinek and R. L. Mercer, “Interpolated estimation of Markov source parameters from sparse data,” in Pattern Recognition in Practice, E. S. Celesma and L. N. Kanal, Eds. Amsterdam, The Netherlands: North-Holland, 1980, pp. 381-397.
37. R. Schwartz et al., “Context-dependent modeling for acoustic-phonetic recognition of continuous speech,” in Conf. Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, pp. 1205-1208, Apr. 1985.
38. K. F. Lee and H. W. Hon, “Large-vocabulary speaker-independent continuous speech recognition,” in Conf. Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, pp. 123-126, Apr. 1988.
39. L. R. Rabiner, S. E. Levinson, and M. M. Sondhi, “On the application of vector quantization and hidden Markov models to speaker-independent isolated word recognition,” Bell Syst. Tech. J., vol. 62, no. 4, pp. 1075-1105, Apr. 1983.
40. “On the use of hidden Markov models for speaker-independent recognition of isolated words from a medium-size vocabulary,” AT&T Tech.]., vol. 63, no. 4, pp. 627-642, Apr. 1984.
41. R. Billi, “Vector quantization and Markov source models applied to speech recognition,” in Proc. ICASSP ′82 (Paris, France), pp. 574-577, May 1982.
42. L. R. Rabiner, B. H. Juang, S. E. Levinson, and M. M. Sondhi, “Recognition of isolated digits using hidden Markov models with continuous mixture densities,” AT&T Tech. J., vol. 64, no. 6, pp. 1211-1222, July-Aug. 1986.
43. A. B. Poritz and A. C. Richter, “Isolated word recognition,” in Proc. ICASSP ′86 (Tokyo, Japan), pp. 705-708, Apr. 1986.
44. R. P. Lippmann, E. A. Martin, and D. B. Paul, “Multistyle training for robust isolated word speech recognition,” in Proc. ICASSP ′87 (Dallas, TX), pp. 705-708, Apr. 1987.
45. D. B. Paul, “A speaker stress resistant HMM isolated word recognizer,” in Proc. IG4SSP′87 (Dallas,TX), pp. 713-716, Apr. 1987.
46. V. N. Gupta, M. Lennig and P. Mermelstein, “Integration of acoustic information in a large vocabulary word recognizer,” in Conf. Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, pp. 697-700, Apr. 1987.
47. S. E. Levinson, “Continuous speech recognition by means of acoustic-phonetic classification obtained from a hidden Markov model,” in Proc. ICASSP ′87 (Dallas TX), Apr. 1987.
48. J. G. Wilpon, L. R. Rabiner, and T. Martin, “An improved word detection algorithm for telephone quality speech incorporating both syntactic and semantic constraints,” AT&T Bell Labs Tech. J., vol. 63, no. 3, pp. 479-498, Mar. 1984.
49. J. G. Wilpon and L. R. Rabiner, “Application of hidden Markov models to automatic speech endpoint detection,” Computer Speech and Language, vol. 2, no. 3/4, pp. 321-341, Sept./Dec. 1987.
50. A. Averbuch et al., “Experiments with the TANGORA 20,000 word speech recognizer,” in Conf. Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, pp. 701-704, Apr. 1987.
51. B. S. Atal and S. L. Hanauer, “Speech analysis and synthesis by linear prediction of the speech wave,” J. Acoust. Soc. Am., vol. 50, pp. 637-655, 1971.
52. F. I. Itakura and S.Saito, “Analysis-synthesis telephony based upon the maximum likelihood method,” in Proc. 6th Int. Congress on Acoustics (Tokyo, Japan), pp. C17-20, 1968.
53. J. Makhoul, “Linear prediction: A tutorial review,” Proc. IEEE, vol. 63, pp. 561-580, 1975.
54. J. D. Markel and A. H. Gray, Jr., Linear Prediction of Speech. New York, NY: Springer-Verlag, 1976.
55. Y.Tokhura, “A weighted cepstral distance measure for speech recognition,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-35, no. 10, pp. 1414-1422, Oct. 1987.
56. B. H. Juang, L. R. Rabiner, and J. G. Wilpon, “On the use of bandpass littering in speech recognition,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-35, no. 7, pp. 947-954, July 1987.
57. S. Furui, “Speaker independent isolated word recognition based on dynamics emphasized cepstrum,” Trans. IECE of Japan, vol. 69, no. 12, pp. 1310-1317, Dec. 1986.
58. F. K. Soong and A. E. Rosenberg, “On the use of instantaneous and transitional spectral information in speaker recognition,” in Proc. ICASSP ′86 (Tokyo, Japan), pp. 877-880, Apr. 1986.
59. L. R. Rabiner, J. G. Wilpon, and B. H. Juang, “A segmental k-means training procedure for connected word recognition,” AT&T Tech. J., vol. 65, no. 3, pp. 21-31, May-June 1986.
60. L. R. Rabiner and S. E. Levinson, “A speaker-independent, syntax-directed, connected word recognition system based on hidden Markov models and level building,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-33, no. 3, pp. 561-573, June 1985.
61. L. R. Rabiner, J. G. Wilpon, and B. H. Juang, “A model-based connected digit recognition system using either hidden Markov models or templates,” Computer, Speech, and Language, vol. 1, no. 2, pp. 167-197, Dec. 1986.
62. H. Bourlard, Y. Kamp, H. Ney, and C. J. Wellekens, “Speaker-dependent connected speech recognition via dynamic programming and statistical methods,” in Speech and Speaker Recognition, M. R. Schroeder, Ed. Basel, Switzerland: Karger, 1985, pp. 115-148.
63. C. J. Wellekens, “Global connected digit recognition using Baum-Welch algorithm,” in Proc. ICASSP ′86 (Tokyo, Japan), pp. 1081-1084, Apr. 1986.
64. A. M. Derouault, “Context dependent phonetic Markov models for large vocabulary speech recognition,” in Proc. ICASSP ′87 (Dallas, TX), Paper 10.1.1, pp. 360-363, Apr. 1987.
65. B. Merialdo, “Speech recognition with very large size dictionary,” in Proc. ICASSP ′87 (Dallas, TX), Paper 10.2.2, pp. 364-367, Apr. 1987.
66. Y. L. Chow et al., “BYBLOS: The BBN continuous speech recognition system,” in Proc. ICASSP ′87 (Dallas,TX), Paper 3.7.1, pp. 89-92, Apr. 1987.