Advertisement

Weighted Finite-State Transducer Algorithms. An Overview

  • Mehryar Mohri
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 148)

Summary

Weighted finite-state transducers are used in many applications such as text, speech and image processing. This chapter gives an overview of several recent weighted transducer algorithms, including composition of weighted transducers, determinization of weighted automata, a weight pushing algorithm, and minimization of weighted automata. It briefly describes these algorithms, discusses their running time complexity and conditions of application, and shows examples illustrating their application.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alfred V. Aho, John E. Hoperoft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley: Reading, MA, 1974.zbMATHGoogle Scholar
  2. 2.
    Cyril Allauzen and Mehryar Mohri. Efficient Algorithms for Testing the Twins Property. Journal of Automata, Languages and Combinatorics, 8 (2), 2003.Google Scholar
  3. 3.
    Jean Berstel. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart, 1979.zbMATHGoogle Scholar
  4. 4.
    Jean Berstel and Christophe Reutenauer. Rational Series and Their Languages. Springer-Verlag: Berlin-New York, 1988.zbMATHCrossRefGoogle Scholar
  5. 5.
    Karel Culik II and Jarkko Kari. Digital Images and Formal Languages. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, volume 3, pages 599–616. Springer, 1997.CrossRefGoogle Scholar
  6. 6.
    Samuel Eilenberg. Automata, Languages and Machines,volume A. Academic Press, 1974.Google Scholar
  7. 7.
    Werner Kuich and Arto Salomaa. Semirings, Automata, Languages. Number 5 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1986.Google Scholar
  8. 8.
    Daniel J. Lehmann. Algebraic Structures for Transitive Closures. Theoretical Computer Science, 4: 59–76, 1977.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Mehryar Mohri. Finite-State Transducers in Language and Speech Processing. Computational Linguistics, 23: 2, 1997.MathSciNetGoogle Scholar
  10. 10.
    Mehryar Mohri. General Algebraic Frameworks and Algorithms for Shortest-Distance Problems. Technical Memorandum 981210–10TM, AT&T Labs - Research, 62 pages, 1998.Google Scholar
  11. 11.
    Mehryar Mohri. Semiring Frameworks and Algorithms for Shortest-Distance Problems. Journal of Automata, Languages and Combinatorics, 7 (3): 321–350, 2002.MathSciNetzbMATHGoogle Scholar
  12. 12.
    Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley. Weighted Automata in Text and Speech Processing. In Proceedings of the 12th biennial European Conference on Artificial Intelligence (ECA I-96), Workshop on Extended finite state models of language, Budapest, Hungary. ECAI, 1996.Google Scholar
  13. 13.
    Fernando C. N. Pereira and Michael D. Riley. Speech Recognition by Composition of Weighted Finite Automata. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 431–453. MIT Press, Cambridge, Massachusetts, 1997.Google Scholar
  14. 14.
    Dominique Revuz. Minimisation of Acyclic Deterministic Automata in Linear Time. Theoretical Computer Science, 92: 181–189, 1992.MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Arto Salomaa and Matti Soittola. Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag: New York, 1978.zbMATHCrossRefGoogle Scholar
  16. 16.
    Marcel Paul Schützenberger. Sur une variante des fonctions séquentielles. Theoretical Computer Science, 4 (1): 47–57, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Mehryar Mohri
    • 1
  1. 1.Shannon LaboratoryAT&T Labs - ResearchFlorham ParkUSA

Personalised recommendations