Weighted Finite-State Transducer Algorithms. An Overview
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.
Unable to display preview. Download preview PDF.
- 2.Cyril Allauzen and Mehryar Mohri. Efficient Algorithms for Testing the Twins Property. Journal of Automata, Languages and Combinatorics, 8 (2), 2003.Google Scholar
- 6.Samuel Eilenberg. Automata, Languages and Machines,volume A. Academic Press, 1974.Google Scholar
- 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
- 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
- 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.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
- 16.Marcel Paul Schützenberger. Sur une variante des fonctions séquentielles. Theoretical Computer Science, 4 (1): 47–57, 1977.Google Scholar