Finite-State Transducers in Language and Speech Processing

Computational Linguistics

Volumn 23, Issue 2, 1997, Pages 268-311

  Mohri, Mehryar ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; SPEECH PROCESSING; SPEECH RECOGNITION;

CLASSICAL THEOREMS; DETERMINIZATION; FINITE STATE TRANSDUCERS; NATURAL LANGUAGE PROCESSING; SEQUENTIAL TRANSDUCERS;

TRANSDUCERS;

EID: 0348198473     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (49)

1. Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. 1974. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, MA.
2. Aho, Alfred V., Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers, Principles, Techniques and Tools. Addison Wesley, Reading, MA.
3. Ahuja, Ravindra K., Kurt Mehlhorn, James B. Orlin, and Robert Tarjan. 1988. Faster algorithms for the shortest path problem. Technical Report 193, MIT Operations Research Center.
4. Bauer, W. 1988. On minimizing finite automata. EATCS Bulletin, 35.
5. Berstel, Jean. 1979. Transductions and Context-free Languages. Teubner Studienbucher, Stuttgart.
6. Berstel, Jean and Christophe Reutenauer. 1988. Rational Series and Their Languages. Springer-Verlag, Berlin and New York.
7. Brzozowski, J. A. 1962. Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata, 12:529-561.
8. Carlyle, J. W. and A. Paz. 1971. Realizations by stochastic finite automaton. Journal of Computer and System Sciences, 5:26-40.
9. Choffrut, Christian. 1978. Contributions à l'étude de quelques familles remarquables de fonctions rationnelles. Ph.D. thesis, (thèse de doctorat d'Etat), Université Paris 7, LITP, Paris.
10. Cormen, T., C. Leiserson, and R. Rivest. 1992. Introduction to Algorithms. The MIT Press, Cambridge, MA.
11. Courcelle, Bruno, Damian Niwinski, and Andreas Podelski. 1991. A geometrical view of the determinization and minimization of finite-state automata. Mathematical Systems Theory, 24:117-146.
12. Crochemore, Maxime. 1986. Transducers and repetitions. Theoretical Computer Science, 45.
13. Eilenberg, Samuel. 1974-1976. Automata, Languages and Machines, volume A-B. Academic Press.
14. Elgot, C. C. and J. E. Mezei. 1965. On relations defined by generalized finite automata. IBM Journal of Research and Development, 9.
15. Ginsburg, S. and G. F. Rose. 1966. A characterization of machine mappings. Canadian Journal of Mathematics, 18.
16. Gross, Maurice. 1989. The use of finite automata in the lexical representation of natural language. Lecture Notes in Computer Science, 377.
17. Hopcroft, John E. and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading, MA.
18. Kaplan, Ronald M. and Martin Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3).
19. Karlsson, Fred, Atro Voutilainen, Juha Heikkila, and Atro Anttila. 1995. Constraint Grammar, A Language-Independent System for Parsing Unrestricted Text. Mouton de Gruyter.
20. Karttunen, Lauri, Ronald M. Kaplan, and Annie Zaenen. 1992. Two-level morphology with composition. In Proceedings of the Fifteenth International Conference on Computational Linguistics (COLING-92), Nantes, France. COLING.
21. Krob, Daniel. 1994. The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Journal of Algebra and Computation, 4.
22. Kuich, Werner and Arto Salomaa. 1986. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Number 5. Springer-Verlag, Berlin.
23. nd Annual Meeting, Las Cruces, New Mexico. Association for Computational Linguistics.
24. Mohri, Mehryar. 1994b. Minimization of sequential transducers. Lecture Notes in Computer Science, 807.
25. Mohri, Mehryar. 1994c. On some applications of finite-state automata theory to natural language processing: Representation of morphological dictionaries, compaction, and indexation. Technical Report IGM 94-22, Institut Gaspard Monge, Noisy-le-Grand.
26. Mohri, Mehryar. 1994d. Syntactic analysis by local grammars automata: An efficient algorithm. In Proceedings of the International Conference on Computational Lexicography (COMPLEX 94). Linguistic Institute, Hungarian Academy of Science, Budapest, Hungary.
27. Mohri, Mehryar. 1995. Matching patterns of an automaton. Lecture Notes in Computer Science, 937.
28. Mohri, Mehryar, 1996a. On The Use of Sequential Transducers in Natural Language Processing. In Yves Shabes, editor, Finite State Devices in Natural Language Processing. MIT Press, Cambridge, MA. To appear.
29. Mohri, Mehryar. 1996b. On some applications of finite-state automata theory to natural language processing. Journal of Natural Language Engineering, 2:1-20.
30. Mohri, Mehryar, Fernando C. N. Pereira, and Michael Riley. 1996. Weighted automata in text and speech processing. In ECAI-96 Workshop, Budapest, Hungary. ECAI.
31. Mohri, Mehryar and Richard Sproat. 1996. An efficient compiler for weighted rewrite rules. In Proceedings of the 34th Annual Meeting, Santa Cruz, California. Association for Computational Linguistics.
32. Nerode, Anil. 1958. Linear automaton transformations. In Proceedings of AMS, volume 9.
33. Pereira, Fernando C. N. and Michael Riley, 1996. Weighted Rational Transductions and their Application to Human Language Processing. In Yves Shabes, editor, Finite State Devices in Natural Language Processing. MIT Press, Cambridge, MA. To appear.
34. Perrin, Dominique. 1990. Finite automata. In J. Van Leuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier, Amsterdam, pages 1-57.
35. Reutenauer, Christophe and Marcel Paul Schützenberger. 1995. Variétés et fonctions rationnelles. Theoretical Computer Science, 145.
36. Revuz, Dominique. 1992. Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92:181-189.
37. Roche, Emmanuel. 1993. Analyse syntaxique transformationnelle du français par transducteurs et lexique-grammaire. Ph.D. thesis, Université Paris 7, Paris.
38. Salomaa, Arto and Matti Soittola. 1978. Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag, New York.
39. Schützenberger, Marcel Paul. 1961. On the definition of a family of automata. Information and Control, 4.
40. Schützenberger, Marcel Paul. 1977. Sur une variante des fonctions séquentielles. Theoretical Computer Science.
41. Schützenberger, Marcel Paul. 1987. Polynomial decomposition of rational functions. In Lecture Notes in Computer Science, volume 386. Springer-Verlag, Berlin, Heidelberg, and New York.
42. Silberztein, Max. 1993. Dictionnaires électroniques et analyse automatique de textes: le système INTEX. Masson, Paris.
43. Simon, Imre. 1987. The nondeterministic complexity of finite automata. Technical Report RT-MAP-8073, Instituto de Matemática e Estatistica da Universidade de São Paulo.
44. Sproat, Richard. 1995. A finite-state architecture for tokenization and grapheme-to-phoneme conversion in multilingual text analysis. In Proceedings of the ACL SIGDAT Workshop, Dublin, Ireland. ACL.
45. Thorup, Mikkel. 1996. On ram priority queues. In Proceedings of SODA'96, Atlanta, Georgia. ACM, SIAM, New York.
46. Urbanek, F. 1989. On minimizing finite automata. EATCS Bulletin, 39.
47. Watson, Bruce W. 1993. A taxonomy of finite automata minimization algorithms. Technical Report 93/44, Eindhoven University of Technology, The Netherlands.
48. Weber, Andreas and Reinhard Klemm. 1995. Economy of description for single-valued transducers. Information and Computation, 119.
49. Woods, W.A. 1970. Transition network grammars for natural language analysis. Communications of the Association for the Computational Machinery, 13(10).