Algorithmic Aspects in Speech Recognition: An Introduction

ACM Journal of Experimental Algorithmics

Volumn 2, Issue , 1997, Pages 1-

  Buchsbaum, Adam L ^a   Giancarlo, Raffaele ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

Algorithms; automata theory; Experimentation; graph searching; Theory

Indexed keywords

EID: 84988951426     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/264216.264219     Document Type: Article

References (51)

1. Allen, J.B. 1996. Harvey Fletcher's role in the creation of communication acoustics. Journal of the Acoustical Society of America 99, 4, 1825-1839.
2. Bahl, L. R., Bakis, R., Cohen, P. S., Cole, A. G., Jelinek, F., Lewis, B. L., and Mercer, R. L. 1980. Further results on the recognition of a continuously read natural corpus. In Proc. IEEE Int’l Conf. on Acoustics, Speech, and Signal Processing, Volume 3 (1980), pp. 872-875.
3. Bahl, L. R., Bakis, R., de Souza, P. V., and Mercer, R. L. 1988. Obtaining candidate words by polling in a large vocabulary speech recognition system. In Proc. IEEE Int’l. Conf. on Acoustics, Speech, and Signal Processing, Volume 1 (1988), pp. 489-492.
4. Bahl, L. R., Gennaro, S. V. D., Gopalakrishnan, P. S., and Mercer, R. L. 1993. A fast approximate acoustic match for large vocabulary speech recognition. IEEE Transactions on Speech and Audio Processing 1, 59-67.
5. Bahl, L. R., Gopalakrishnan, P. S., Kanevski, D., and Nahamoo, D. 1989. Matrix fast match: A fast method for identifying a short list of candidate words for decoding. In Proc. IEEE Int’L Conf. on Acoustics, Speech, and Signal Processing, Volume 1 (1989), pp. 345-348.
6. Bahl, L. R., Jelinek, F., and Mercer, R. L. 1983. A maximum likelihood approach to continuous speech recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-5, 179-190.
7. Baum, L. E. and Eagon, J. A. 1967. An inequality with applications to statistical estimation for probabilistic functions of a Markov process and to a model for ecology. Bulletin of the American Mathematical Society 73, 360-363.
8. Baum, L. E. and Sell, G. R. 1968. Growth transformations for functions on manifolds. Pacific Journal of Mathematics 27, 211-227.
9. Bellman, R. 1958. On a routing problem. Quarterly of Applied Mathematics 16, 87-90.
10. Berstel, J. 1979. Transduction and Context-Free Languages, Volume 38 of Leitfaden der angewandten Mathematik und Mechanik LAMM. Springer-Verlag.
11. Berstel, J. and Reutenauer, C. 1988. Rational Series and Their Languages, Volume 12 of EAT CS Monographs on Theoretical Computer Science. Springer-Verlag.
12. Boothroyd, A. 1968. Statistical theory of the speech discrimination score. Journal of the Acoustical Society of America 43, 2, 362-7.
13. Boothroyd, A. and Nlttrouer, S. 1988. Mathematical treatment of context effects in phoneme and word recognition. Journal of the Acoustical Society of America 84, 1, 101-14.
14. Breslauer, D. 1996. The suffix tree of a tree and minimizing sequential transducers. In Proc. 7th Symposium on Combinatorial Pattern Matching (1996).
15. Choffrut, C. 1978. Contributions a l’étude de quelques familles remarquables de function rationnelles. Ph. D. thesis, LITP-Université Paris 7, Paris, France.
16. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1991. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. MIT Press, Cambridge, MA. Dljkstra, E. W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1, 269-271.
17. Edmonds, J. and Karp, R. M. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19, 248-264.
18. Eilenberg, S. 1974. Automata, Languages, and Machines, Volume A. Academic Press, San Diego.
19. Elgot, C. C. and Mezei, J. E. 1965. On relations defined by generalized finite automata. IBM Journal of Research and Development 9, 47-68.
20. Fletcher, H. and Galt, R. H. 1950. The perception of speech and its relation to telephony. Journal of the Acoustical Society of America 22, 2, 89-151.
21. Ford, L. R. and Fulkerson, D. R. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
22. Gabow, H. N. 1985. Scaling algorithms for network problems. Journal of Computer and System Sciences 31, 148-168.
23. Gabow, H. N. and Tarjan, R. E. 1989. Faster scaling algorithms for network problems. SIAM Journal on Computing 18, 1013-1036.
24. Hart, P. E., Nilsson, N. J., and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science, and Cybernetics 4, 100-107.
25. Hopcroft, J. E. and Ullman, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, Reading, MA.
26. Jelinek, F., Bahl, L. R., and Mercer, R. L. 1975. Design of a linguistic statistical decoder for the recognition of continuous speech. IEEE Transactions on Information Theory IT-21, 250-256.
27. Jelinek, F., Mercer, R. L., and Roukos, S. 1992. Principles of lexical language modeling for speech recognition. In S. Furui and M. M. Sondhi Eds., Advances in Speech Signal Processing, Chapter 21, pp. 651-699. New York: Marcel Dekker.
28. Kenny, P., Hollan, R., Gupta, V. N., Lenning, M., Mermelstein, P., and O'Shaughnessy, D. 1993. A-Admissible heuristicsfor rapid lexical access. IEEE Transactions on Speech and Audio Processing 1, 49-57.
29. Kuich, W. and Salomaa, A. 1986. Semirings, Automata, Languages, Volume 5 of EAT CS Monographs on Theoretical Computer Science. Springer-Verlag.
30. Lacouture, R. and Mori, R. D. 1991. Lexical tree compression. In Proc. 2nd Euro. Conf. on Speech Communication and Technology, Volume 2 (1991), pp. 581-584.
31. Lee, K.-F. 1990. Context-dependent phonetic hidden Markov models for speaker-independent continuous speech recognition. In A. Waibel and K.-F. Lee Eds., Readings in Speech Recognition, pp. 347-365. Morgan Kaufman.
32. Ljolje, A. and Riley, M. D. 1992. Optimal search recognition using phone recognition and lexical access. In Proc. 2nd Int’l. Conf. on Spoken Language Processing (1992), pp. 313-316.
33. Lowerre, B. and Reddy, R. 1980. The Harpy speech understanding system. In Trends in Speech Recognition, Chapter 15, pp. 340-360. Englewood Cliffs, NJ: Prentice-Hall.
34. Mohri, M. 1994. Minimization of sequential transducers. In Proc. 5th Symposium on Combinatorial Pattern Matching, Volume 807 of Lecture Notes in Computer Science (1994), pp.151-63.
35. Mohri, M. 1997a. Finite-state transducers in language and speech processing. To appear in Computational Linguistics.
36. Mohri, M. 1997b. On the use of sequential transducers in natural language processing. In Finite State Devices in Natural Language Processing. MIT Press. To appear.
37. Pereira, F. and Rlley, M. 1997. Speech recognition by composition of weighted finite automata. In Finite State Devices in Natural Language Processing. MIT Press. To appear.
38. Pereira, F., Rlley, M., and Sproat, R. 1994. Weighted rational transductions and their application to human language processing. In Proc. ARPA Human Language Technology Conf. (1994), pp. 249-254.
39. Pickering, J. B. and Rosner, B. S. 1993. The Oxford Acoustic Phonetic Database on Compact Disk. Oxford University Press.
40. Rabiner, L. And Juang, B.-H. 1993. Fundamentals of Speech Recognition. Prentice Hall Signal Processing Series. Prentice Hall, Englewood Cliffs, NJ.
41. Rabiner, L. R. 1990. A tutorial on hidden Markov models and selected applications in speech recognition. In A. Waibel and K.-F. Lee Eds., Readings in Speech Recognition, pp. 367-396. Morgan Kaufman.
42. Reutenauer, C. and Schützenberger, M.-P. 1991. Minimization of rational word functions. SIAM Journal on Computing 20, 4, 669-685.
43. th Euro. Conf. on Speech Communication and Technology, Volume 1 (1995), pp. 207-210.
44. Roche, E. 1993. Analyse syntaxique transformationeile du francais par transducteurs et lexique-grammaire. Ph. D. thesis, LITP-Université Paris 7, Paris, France.
45. Roche, E. 1995. Smaller representations for finite-state transducers and finite-state automata. In Proc. 6th Symposium on Combinatorial Pattern Matching, Volume 937 of Lecture Notes in Computer Science (1995), pp. 352-365.
46. Schwartz, R., Chow, Y., Roucos, S., Krasner, M., and Makhoul, J. 1984. Improved hidden Markov modeling of phonemes for continuous speech recognition. In Proc. IEEE Int’l. Conf. on Acoustics, Speech, and Signal Processing, Volume 3 (1984), pp. 35.6.1-4.
47. Shoup, J. E. 1980. Phonological aspects of speech recognition. In Trends in Speech Recognition, Chapter 6, pp. 125-138. Englewood Cliffs, NJ: Prentice-Hall.
48. Silberztein, M. 1993. Dictionnaires électroniques et analise automatique de textes: le système intex. Ph. D. thesis, Masson, Paris, France.
49. Soong, F. K. and Huang, E.-F. 1991. A tree-trellis based fast search for finding the N best sentence hypotheses in continuous speech recognition. In Proc. IEEE Int’l. Conf. on Acoustics, Speech, and Signal Processing, Volume 1 (1991), pp. 705-708.
50. Viterbi, A. J. 1967. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Transactions on Information Theory IT-13, 260-269.
51. Waibel, A. and Lee, K.-F. Eds. 1990. Readings in Speech Recognition. Morgan Kaufmann. weber, A. and Klemm, R. 1995. Economy of description for single-valued transducers. Information and Computation 118, 327-40.