The design principles of a weighted finite-state transducer library

Theoretical Computer Science

Volumn 231, Issue 1, 2000, Pages 17-32

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

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Finite state transducers; Rational power series; Speech recognition; Weighted automata

Indexed keywords

EID: 0012306376     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00014-6     Document Type: Article

References (40)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974
2. A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley: Reading, MA, 1986.
3. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, MA, 1992.
4. K. Culik II, J. Kari, Digital images and formal languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Berlin, 1997, pp. 599-616,
5. M. Gross, The Use of Finite Automata in the Lexical Representation of Natural Language, Lecture Notes in Computer Science, vol. 377, Springer, Berlin, 1989.
6. M. Gross, D. Perrin (Eds.), Electronic Dictionnaries and Automata in Computational Linguistics, Lecture Notes in Computer Science, vol. 377, Springer, Berlin, 1989.
7. R.M. Kaplan, M. Kay, Regular Models of Phonological Rule Systems, Comput. Linguistics 20 (3) (1994) 331-378.
8. F. Karlsson, A. Voutilainen, J. Heikkila, A. Anttila, Constraint Grammar, A language-Independent System for Parsing Unrestricted Text, Mouton de Gruyter, 1995.
9. L. Karttunen, The Replace Operator, 33rd Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, 1995, pp. 16-23, Distributed by Morgan Kaufmann Publishers, San Francisco, CA.
10. L. Karttunen, R.M. Kaplan, A. Zaenen, Two-level Morphology with Composition, in Proc. 15th Internat. Conf. on Computational Linguistics (COLING'92), Nantes, France, COLING, 1992.
11. K. Koskenniemi, Finite-state parsing and disambiguation, Proc. 13th Internat. Conf. on Computational Linguistics (COLING'90), Helsinki, Finland, COLING, 1990.
12. K.-F. Lee, Context dependent phonetic hidden Markov models for continuous speech recognition, IEEE Trans. Acouts. Speech Signal Process. 38 (4) (1990) 599-609.
13. A. Ljolje, M.D. Riley, Optimal speech recognition using phone recognition and lexical access, in Proc. ICSLP, Banff, Canada, October 1992, pp. 313-316.
14. M. Mohri, Compact representations by finite-state transducers, in 32nd Meeting of the Association for Computational Linguistics (ACL 94), Proc. Conf. Las Cruces, NM, ACL, 1994.
15. M. Mohri, Minimization of Sequential Transducers, Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994.
16. M. Mohri, Syntactic Analysis by local grammars automata: an efficient algorithm, in Proc. Internat. Conf. on Computational Lexicography (COMPLEX 94), Linguistic Institute, Hungarian Academy of Science, Budapest, Hungary, 1994.
17. M. Mohri, On some applications of finite-state automata theory to natural language processing, J. Natural Language Eng. 2 (1996) 1-20.
18. M. Mohri, Finite-State Transducers in Language and Speech Processing, Comput. Linguistics 23 (2) (1997) 269-311.
19. M. Mohri, On the use of sequential transducers in natural language processing, in: E. Roche, Y. Schabes (Eds.), Finite-State Language Processing, MIT Press, Cambridge, MA, 1997, 355-382.
20. M. Mohri, General Algebraic Framework and Algorithms for Shortest Distance Problems. Technical Memorandum, AT&T Labs-Research, 981210-TM, 1998.
21. M. Mohri, Minimization algorithms for sequential transducers, Theoret. Comput. Sci. (2000) to appear.
22. M. Mohri, F.C.N Pereira, M. Riley, Weighted automata in text and speech processing, in ECAI-96 Workshop, Budapest, Hungary, ECAI, 1996.
23. M. Mohri, M. Riley, Weighted determinization and minimization for large vocabulary speech recognition, in Eurospeech'97, Rhodes, Greece, 1997.
24. M. Mohri, M. Riley, D. Hindle, A. Ljolje, F.C. N. Pereira, Full expansion of context-dependent networks in large vocabulary speech recognition, in Proc. ICASSP'98, IEEE, New York, 1998.
25. M. Mohri, R. Sproat, An efficient compiler for weighted rewrite rules, in 34th Meeting of the Association for Computational Linguistics (ACL 96), Proc. Conf., Santa Cruz, Ca, ACL, 1996.
26. D. Musser, A. Saini, STL Tutorial and Reference Guide, Addison-Wesley, Reading, MA, 1996.
27. F.C.N. Pereira, M.D. Riley, Speech recognition by composition of weighted finite automata, in: E. Roche, Y. Schabes (Eds.), Finite-State Language Processing, MIT Press, Cambridge, Ma, 1997, pp. 431-453.
28. D. Revuz, Minimisation of acyclic deterministic automata in linear time, Theoret. Comput. Sci. 92 (1992) 181-189.
29. G. Riccardi, E. Bocchieri, R. Pieraccini, Non-deterministic stochastic language models for speech recognition, in Proc. IEE Internat. Conf. on Acoustics, Speech and Signal Processing, vol. 1, IEEE, New York, 1995, pp. 237-240
30. M. Riley, F. Pereira, M. Mohri, Transducer composition for context-dependent network expansion, in Eurospeech'97, Rhodes, Greece, 1997.
31. E. Ristad, P. Yianilos, Finite growth models, Technical Report CS-TR-533-96, Department of Computer Science, Princeton University, 1996.
32. E. Roche, Analyse Syntaxique Transformationnelle du Français par Transducteurs et Lexique-Grammaire, Ph.D. Thesis, Université Paris 7, 1993.
33. E. Roche, Two parsing methods by means of finite state tansducers, in Proc. 16th Internat. Conf. on Computational Linguistics (COLING'94), Kyoto, Japan, COLING, 1994.
34. A. Salomaa, M. Soittola, Automata-Theoretic Aspects of Formal Power Series, Springer, New York, 1978.
35. M.P. Schützenberger, On the definition of a family of automata, Inform. Control 4 (1961).
36. M. Silberztein, Dictionnaires électroniques et analyse automatique de textes: le système INTEX, Masson, Paris, France, 1993.
37. I. Simon, Limited subsets of a free monoid, in Proc. 19th Annual Symp. on Foundation of Computer Science, 1978, pp. 143-150.
38. R. Sproat, Morphology and Computation, The MIT Press, Cambridge, MA, 1992.
39. R. Sproat, A finite-state architecture for tokenization and grapheme-to-phoneme conversion in multilingual text analysis, in Proc. ACL SIGDAT Workshop, Dublin, Ireland, ACL, 1995.
40. M. Mohri, F. Pereira, M. Riley, FSM Library - General-Purpose Finite. State Machine Software tools, http://www.research.att.com/tools/fsm, 1998.