AT&T Labs - Research
AT&T  

Reference Material

  • Theory and Algorithms for Automata, Transducers and Rational Power Series

    1. Jean Berstel. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart, 1979.

    2. Jean Berstel and Christophe Reutenauer. Rational Series and Their Languages. Springer-Verlag: Berlin-New York, 1988.

    3. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley: Reading, MA, 1979.

    4. W. Kuich and A. Salomaa. Semirings, Automata, Languages. EATCS Monographs on Theor. Comp. Sc. 5, Springer Verlag, Berlin (1986).

    5. Dominique Perrin. Finite Automata. In J. Van Leuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 1-57. Elsevier, Amsterdam, 1990.

    6. A. Salomaa, M. Soittola. Automata-Theoretic Aspects of Formal Power Series . Springer-Verlag, New York, 1978.

    7. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley: Reading, MA, 1974.

    8. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.

    9. Mehryar Mohri. Generic Epsilon-Removal and Input Epsilon-Normalization Algorithms for Weighted Transducers. International Journal of Foundations of Computer Science, 13(1):129-143, 2002.

    10. Mehryar Mohri. Minimization Algorithms for Sequential Transducers. Theoretical Computer Science, 234:177-201, March 2000.

    11. Mehryar Mohri. Finite-State Transducers in Language and Speech Processing . Computational Linguistics, 23:2, 1997.

    12. Mehryar Mohri. On Some Applications of Finite-State Automata Theory to Natural Language Processing . Natural Language Engineering, 2:1-20, 1996.

  • Weighted Automata and Transducer Algorithms

  • FSM Library and Speech Processing Applications

    1. Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley. A Rational Design for a Weighted Finite-State Transducer Library . Lecture Notes in Computer Science, 1436, 1998.

    2. Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley. Weighted Finite-State Transducers in Speech Recognition. Computer Speech and Language, 16(1):69-88, 2002.

    3. Mehryar Mohri and Michael Riley. An Efficient Algorithm for the N-Best-Strings Problem. In Proceedings of the International Conference on Spoken Language Processing 2002 (ICSLP '02). Denver, Colorado, September 2002.

    4. Mehryar Mohri and Michael Riley. A Weight Pushing Algorithm for Large Vocabulary Speech Recognition. In Proceedings of the 7th European Conference on Speech Communication and Technology (Eurospeech '01). Aalborg, Denmark, September 2001.

    5. Mehryar Mohri and Michael Riley. Network Optimizations for Large Vocabulary Speech Recognition. Speech Communication, 25:3, 1998.

    6. Fernando C. N. Pereira and Michael Riley. Speech Recognition by Composition of Weighted Finite Automata . In E. Roche and Y. Schabes, editors, Finite-State Language Processing. MIT Press, Cambridge, Massachusetts. 1997.

    7. Richard Sproat. Multilingual Text Analysis for Text-to-Speech Synthesis. In Natural Language Engineering, 2(4), 1996.