Weighted finite-state transducers in speech recognition

Computer Speech and Language

Volumn 16, Issue 1, 2002, Pages 69-88

  Mohri, Mehryar ^a   Pereira, Fernando ^b   Riley, Michael ^a  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROADCASTING; FINITE AUTOMATA; MARKOV PROCESSES; MATHEMATICAL MODELS; SPEECH RECOGNITION; SURVEYS;

HIDDEN MARKOV MODELS; WEIGHTED FINITE STATE TRANSDUCERS;

ACOUSTIC TRANSDUCERS;

EID: 0036460907     PISSN: 08852308     EISSN: None     Source Type: Journal    
DOI: 10.1006/csla.2001.0184     Document Type: Article

References (40)

1. Aho, A. V., Hopcroft, J. E. & Ullman, J. D. (1974). The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, MA.
2. Aho, A. V., Sethi, R. & Ullman, J. D. (1986). Compilers, Principles, Techniques and Tools. Addison Wesley, Reading, MA.
3. Berstel, J. & Reutenauer, C. (1988). Rational Series and Their Languages. Springer-Verlag, Berlin-New York.
4. Beutnagel, M., Mohri, M. & Riley, M. (1999). Rapid unit selection from a large speech corpus for concatenative speech synthesis. Proceedings of the 6th European Conference on Speech Communication and Technology (Eurospeech '99), Budapest, Hungary, 607-610.
5. Carlyle, J. W. & Paz, A. (1971). Realizations by stochastic finite automaton. Journal of Computer and System Sciences, 5, 26-40.
6. Cormen, T., Leiserson, C. & Rivest, R. (1992). Introduction to Algorithms. The MIT Press, Cambridge, MA.
7. Crochemore, M. & Rytter, W. (1994). Text Algorithms. Oxford University Press.
8. Culik II, K. & Kari, J. (1997). Digital images and formal languages. In Handbook of Formal Languages (G. Rozenberg and A. Salomaa, eds), pp. 599-616. Springer.
9. Fiscus, J. (1997). Post-processing system to yield reduced word error rates: recognizer output voting error reduction (ROVER). Proceedings of the 1997 IEEE ASRU Workshop, Santa Barbara, CA, pp. 347-354.
10. Hopcroft, J. E. & Ullman, J. D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading, MA.
11. Kaplan, R. M. & Kay, M. (1994). Regular models of phonological rule systems. Computational Linguistics, 20, 331-378.
12. Karttunen, L. (1995). The replace operator. In 33rd Meeting of the Association for Computational Linguistics (ACL 95), Proceedings of the Conference. Massachusetts, ACL, MIT, Cambridge, MA, 16-23.
13. Kuich, W. & Salomaa, A. (1986). Semirings, Automata, Languages. Number 5 in EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, Germany.
14. Leggetter, C. & Woodland, P. (1995). Maximum likelihood linear regession for speaker adaptation of continuous density HMMs. Computer Speech and Language, 9, 171-186.
15. Ljolje, A., Hindle, D., Riley, M. & Sproat, R. (2000). The AT&T LVCSR-2000 system. Proceedings of the NIST Large Vocabulary Conversational Speech Recognition Workshop, College Park, MA.
16. Ljolje, A., Pereira, F. & Riley, M. (1999). Efficient general lattice generation and rescoring. Proceedings of the European Conference on SpeechCommunication and Technology (Eurospeech '99), Budapest, Hungary, 1251-1254.
17. Mohri, M. (1996). On some applications of finite-state automata theory to natural language processing. Journal of Natural Language Engineering, 2, 1-20.
18. Mohri, M. (1997). Finite-state transducers in language and speech processing. Computational Linguistics, 23, 269-312.
19. Mohri, M. (1998). General algebraic frameworks and algorithms for shortest-distance problem. Technical Memorandum 981210-10TM, AT&T Labs-Research, p. 62.
20. Mohri, M. & Nederhof, M.-J. (2001). Regular approximation of context-free grammars through transformation. In Robustness in Language and Speech Technology (J. claude Jungua and G. van Noord, eds), pp. 153-163. Kluwer Academic Publishers, The Netherlands.
21. Mohri, M. & Pereira, F. C. N. (1998). Dynamic compilation of weighted context-free grammars. In 36th Annual Meeting of the ACL and 17th International Conference on Computational Linguistics, volume 2, pp. 891-897.
22. Mohri, M., Pereira, F. & Riley, M. (1996). Weighted automata in text and speech processing. ECAI-96 Workshop, Budapest, Hungary, ECAI.
23. Mohri, M., Pereira, F. & Riley, M. (1997). General-purpose finite-state machine software tools. AT&T Labs-Research, http://www.research.att.com/sw/tools/fsm
24. Mohri, M., Pereira, F. & Riley, M. (January 2000). The design principles of a weighted finite-state transducer library. Theoretical Computer Science, 231, 17-32.
25. Mohri, M. & Riley, M. (1998). Network optimizations for large vocabulary speech recognition. Speech Communication, 25, 1-12.
26. Mohri, M. & Riley, M. (1999). Integrated context-dependent networks in very large vocabulary speech recognition. Proceedings of the 6th European Conference on Speech Communication and Technology (Eurospeech '99), Budapest, Hungary, 811-814.
27. Mohri, M. & Riley, M. (September 2001a). A weight pushing algorithm for large vocabulary speech recognition. Proceedings of the 7th European Conference on Speech Communication and Technology (Eurospeech '01), Aalborg, Denmark, 1603-1606.
28. Mohri, M. & Riley, M. (2001b). DCD library-speech recognition decoder library. AT&T Labs--Research. http://www.research.att.com/sw/tools/dcd
29. Mohri, M., Riley, M., Hindle, D., Ljolje, A. & Pereira, F. (1998). Full expansion of context-dependent networks in large vocabulary speech recognition. Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP '98), Seattle, WA, 665-668.
30. Mohri, M. & Sprout, R. (1996). An efficient compiler for weighted rewrite rules. Proceedings of the Conference on 34th Meeting of the Association for Computational Linguistics (ACL '96), Santa Cruz, CA ACL, pp. 231-238.
31. Nederhof, M.-J. (2000). Practical experiments with regular approximation of context-free languages. Computational Linguistics, 26, 17-44.
32. Ortmanns, S., Ney, H. & Eiden, A. (1996). Language-model look-ahead for large vocabulary speech recognition. Proceedings of the International Conference on Spoken Language Processing (ICSLP'96), University of Delaware and Alfred I. duPont Institute, pp. 2095-2098.
33. Pereira, F. & Riley, M. (1997). Speech recognition by composition of weighted finite automata. In Finite-State Language Processing (E. Roche and Y. Schabes, eds), pp. 431-453. The MIT Press, Cambridge, MA.
34. Pereira, F. & Wright, R. (1997). Finite-state approximation of phrase-structure grammars. In Finite-State Language Processing (E. Roche and Y. Schabes, eds), pp. 149-173. MIT Press.
35. Revuz, D. (1992). Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92, 181-189.
36. Riley, M., Byrne, W., Finke, M., Khudanpur, S., Ljolje, A., McDonough, J., Nock, H., Saraclar, M. Wooters, C. & Zavaliagkos, G. (1999). Stochastic pronunciation modelling form hand-labelled phonetic corpora. Speech Communication, 29, 209-224.
37. Riley, M., Pereira, F. & Mohri, M. (1997). Transducer composition for context-dependent network expansion. Proceedings of European Conference on Speech Communication and Technology '97, Rhodes, Greece, 1427-1430.
38. Salomaa, A. & Soittola, M. (1978). Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag, New York.
39. Seymore, K. & Rosenfeld, R. (1996). Scalable backoff language models. Proceedings of Internation Conference on Spoken Language Processing, Philadelphia, PA, 232-235.
40. Sproat, R. (1997). Multilingual text analysis for text-to-speech synthesis. Journal of Natural Language Engineering, 2, 369-380.