An efficient compiler for weighted rewrite rules

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1996-June, Issue , 1996, Pages 231-238

  Mohri, Mehryar ^a   Sproat, Richard ^b  

^a AT AND T LABS RESEARCH   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; PROGRAM COMPILERS; SPEECH PROCESSING;

CONDITION; CONTEXT DEPENDENT; FINITE STATE TRANSDUCERS; NATURAL LANGUAGES; NATURAL SPEECH; REWRITE RULES; SIMPLE++; WEIGHTED FINITE-STATE TRANSDUCERS; WEIGHTED RULES;

TRANSDUCERS;

EID: 85037151358     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The design and analysis of computer algorithms. Addison Wesley: Reading, MA.
2. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers, Principles, Techniques and Tools. Addison Wesley: Reading, MA.
3. Jean Berstel and Christophe Reutenauer. 1988. Rational Series and Their Languages. Springer-Verlag: Berlin-New York.
4. Jean Berstel. 1979. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart.
5. Samuel Eilenberg. 1974-1976. Automata, Languages and Machines, volume A-B. Academic Press.
6. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability. Freeman and Company, New York.
7. C. Douglas Johnson. 1972. Formal Aspects of Phonological Description. Mouton, Mouton, The Hague.
8. Ronald M. Kaplan and Martin Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3).
9. Lauri Karttunen. 1995. The replace operator. In 33rd Meeting of the Association for Computational Linguistics (ACL 95), Proceedings of the Conference, MIT, Cambridge, Massachussetts. ACL.
10. Wener Kuich and Arto Salomaa. 1986. Semirings, Automata, Languages. Springer-Verlag: Berlin-New York.
11. Mark Liberman. 1994. Commentary on kaplan and kay. Computational Linguistics, 20(3).
12. Robert McNaughton. 1994. The uniform halting problem for one-rule semi-thue systems. Technical Report 94-18, Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York.
13. Mehryar Mohri. 1994. Compact representations by finite-state transducers. In 32nd Meeting of the Association for Computational Linguistics (ACL 94), Proceedings of the Conference, Las Cruces, New Mexico. ACL.
14. Mehryar Mohri. 1995. Matching patterns of an automaton. Lecture Notes in Computer Science, 937.
15. Fernando C. N. Pereira, Michael Riley, and Richard Sproat. 1994. Weighted rational transductions and their application to human language processing. In ARPA Workshop on Human Language Technology. Advanced Research Projects Agency.
16. Grzegorz Rozenberg and Arto Salomaa. 1980. The Mathematical Theory of L Systems. Academic Press, New York.
17. Arto Salomaa and Matti Soittola. 1978. Automata- Theoretic Aspects of Formal Power Series. Springer-Verlag: Berlin-New York.
18. Richard Sproat. 1996. Multilingual text analysis for text-to-speech synthesis. In Proceedings of the ECAI-96 Workshop on Extended Finite State Models of Language, Budapest, Hungary. European Conference on Artificial Intelligence.
19. L. J. Stockmeyer and A. R. Meyer. 1973. Word problems requiring exponential time. In Proceedings of the 5th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, 1-9.