An Efficient Pre-determinization Algorithm
We present a general algorithm, pre-determinization, that makes an arbitrary weighted transducer over the tropical semiring or an arbitrary unambiguous weighted transducer over a cancellative commutative semiring determinizable by inserting in it transitions labeled with special symbols. After determinization, the special symbols can be removed or replaced with ε-transitions. The resulting transducer can be significantly more efficient to use. We report empirical results showing that our algorithm leads to a substantial speed-up in large-vocabulary speech recognition. Our pre-determinization algorithm makes use of an efficient algorithm for testing a general twins property, a sufficient condition for the determinizability of all weighted transducers over the tropical semiring and unambiguous weighted transducers over cancellative commutative semirings. It inserts new transitions just when needed to guarantee that the resulting transducer has the twins property and thus is determinizable. It also uses a single-source shortest-paths algorithm over the min-max semiring for carefully selecting the positions for insertion of new transitions to benefit from the subsequent application of determinization. These positions are proved to be optimal in a sense that we describe.
KeywordsOutput Label Simple Cycle Special Symbol Commutative Semiring Input Label
Unable to display preview. Download preview PDF.
- A.V. Aho, R. Sethi, and J.D. Ullman. Compilers, Principles, Techniques and Tools. Addison Wesley: Reading, MA, 1986.Google Scholar
- C. Allauzen and M. Mohri. Efficient Algorithms for Testing the Twins Property. Journal of Automata, Languages and Combinatorics, 8(2), 2003.Google Scholar
- C. Allauzen and M. Mohri. Finitely Subsequential Transducers. International Journal of Foundations of Computer Science, to appear, 2003.Google Scholar
- C. Choffrut. Contributions à l’étude de quelques familles remarquables de fonctions rationnelles. PhD thesis, (thèse de doctorat d’Etat), Université Paris 7, LITP: Paris, France, 1978.Google Scholar
- T.H. Cormen, C. E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press: Cambridge, MA, 1992.Google Scholar
- K. Culik II and J. Kari. Digital Images and Formal Languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 599–616. Springer, 1997.Google Scholar
- M. Mohri. Finite-State Transducers in Language and Speech Processing. Computational Linguistics, 23(2), 1997.Google Scholar
- M. Mohri, F. C.N. Pereira, and M. Riley. Weighted Automata in Text and Speech Processing. In Proceedings of the 12th biennial European Conference on Artificial Intelligence (ECAI-96), Workshop on Extended finite state models of language, Budapest, Hungary. ECAI, 1996.Google Scholar
- D. Perrin. Words. In M. Lothaire, editor, Combinatorics on words, Cambridge Mathematical Library. Cambridge University Press, 1997.Google Scholar