Efficient backward decoding of high-order hidden Markov models

Pattern Recognition

Volumn 43, Issue 1, 2010, Pages 99-112

  Engelbrecht, H A ^a   du Preez, J A ^a  

^a STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

Decoding; Hidden Markov model; High order; Search

Indexed keywords

BEAM SEARCH; COMPUTATIONAL EXPENSE; HIGH QUALITY; HIGH-ORDER; HUMAN LANGUAGE TECHNOLOGIES; LARGE VOCABULARY; NATURAL LANGUAGES; REAL TIME RECOGNITION; SEARCH; SEARCH ALGORITHMS; VITERBI; WORD GRAPHS;

ACOUSTICS; COMPUTATIONAL EFFICIENCY; DECODING; FLOATING BREAKWATERS; LEARNING ALGORITHMS; LINGUISTICS; OBJECT RECOGNITION; SIGNAL PROCESSING; SPEECH RECOGNITION;

HIDDEN MARKOV MODELS;

EID: 68949131093     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2009.06.004     Document Type: Article

References (32)

1. S. Austin, R. Schwartz, P. Placeway, The forward-backward search algorithm, in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, 1991, pp. 697-700.
2. Aycard O., Mari J.-F., and Washington R. Learning to automatically detect features for mobile robots using second-order hidden Markov models. Int. J. Adv. Robotic Syst. 1 4 (2004) 231-245
3. L.R. Bahl, P.F. Brown, P.V. de Souza, R.L. Mercer, Speech recognition with continuous-parameter hidden Markov models, IBM Research Report RC13123, T.J. Watson Research Center, Yorktown Height, NY, 1987.
4. Bahl L.R., Jelinek F., and Mercer R.L. A maximum likelihood approach to continuous speech recognition. IEEE Trans. Pattern Anal. Mach. Intell. 5 (1983) 179-190
5. Baum L.E., and Eagon J.A. An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull. Am. Math. Soc. 73 (1967) 360-363
6. Baum L.E., and Petrie T. Statistical inference for probabilistic functions of finite state Markov chains. Ann. Math. Stat. 37 (1966) 1554-1563
7. Baum L.E., Petrie T., Soules G., and Weiss N. A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Stat. 41 1 (1970) 164-171
8. Bellman R. Dynamic Programming (1957), Princeton University Press, Princeton, NJ
9. Bengio Y. Markovian models for sequential data. Neural Comput. Surv. 2 (1999) 129-162
10. Berchtold A. The double chain Markov model. Commun. Stat. Theory Methods 28 11 (1999) 2569-2589
11. Berchtold A. High-order extensions of the double chain Markov model. Stochastic Models 18 2 (2002) 193-227
12. Canavan A., and Zipperlen G. CALLFRIEND American English-Non-Southern Dialect (1996), Linguistic Data Consortium, Philadelphia
13. Du Preez J.A. Efficient training of high-order hidden Markov models, using first-order representations. Comput. Speech Lang. 12 1 (1998) 23-39
14. C. Eng, A. Thibessard, S. Hergalant, J.-F. Mari, P. Leblond, Data mining using hidden Markov models (HMM2) to detect heterogeneities into bacteria genomes, Journes Ouvertes Biol. Inf. Math., (JOBIM) 2005, Lyon, France, (2005). http://pbil.univ-lyon1.fr/events/jobim2005/proceedings/.
15. H.A. Engelbrecht, Efficient decoding of high-order hidden Markov models, Ph.D. Dissertation, Stellenbosch University, 2007.
16. Forney G.D. The Viterbi algorithm. Proc. IEEE 61 (1973) 268-278
17. Jelinek F. Continuous speech recognition by statistical methods. IEEE Proc. 64 4 (1976) 532-556
18. Levinson S.E. Structural methods in automatic speech recognition. IEEE Proc. 73 11 (1985) 1625-1650
19. B.T. Lowerre, The HARPY speech recognition system, Ph.D. Dissertation, Carnegie-Mellon University, 1976.
20. J. Mari, D. Fohr, J. Junqua, A second-order HMM for high-performance word and phoneme-based continuous speech recognition, in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, 1996, pp. 435-438.
21. Mari J.-F., Haton J.-P., and Kriouile A. Automatic word recognition based on second-order hidden Markov models. IEEE Trans. Speech Audio Process. 5 3 (1997) 22-25
22. Nel E.-M., Du Preez J.A., and Herbst B.M. Estimating the pen trajectories of static signatures using hidden Markov models. IEEE Trans. Pattern Anal. Mach. Intell. 27 11 (2005) 1733-1746
23. Ney H., Mergel D., Noll A., and Paeseler A. Data driven search organization for continuous speech recognition. IEEE Trans. Signal Process. 40 2 (1992) 272-281
24. L. Nguyen, R. Schwartz, F. Kubala, P. Placeway, Search algorithms for software-only real-time recognition with very large vocabularies, in: Proceedings of the Workshop on Human Language Technology, 1993, pp. 91-95.
25. A.B. Poritz, Hidden Markov models: a guided tour, in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 2, 1988, pp. 215-218.
26. Rabiner L.R. A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77 2 (1989) 257-286
27. Rabiner L.R., and Juang B.H. An introduction to hidden Markov models. IEEE ASSP Mag. 1 3 (1986) 4-16
28. M. Ravishankar, Efficient algorithms for speech recognition, Ph.D. Thesis, Carnegie Mellon University, Technical Report CMU-CS-96-143, 1996.
29. R. Schwartz, S. Austin, Efficient, high-performance algorithms for N-best search, in: Proceedings of the Workshop on Speech and Natural Language, 1990, pp. 6-11.
30. A. Sixtus, S. Ortmanns, High-quality word graphs using forward-backward pruning, in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, 1999, pp. 593-596.
31. V. Steinbiss, B.-H. Tran, H. Ney, Improvements in beam search, in: International Conference on Spoken Language Processing, vol. 4, 1994, pp. 2143-2146.
32. Viterbi A. Error bounds for convolutional codes and asymptotically optimum decoding algorithms. IEEE Trans. Inf. Theory 13 2 (1967) 260-269