Abstract
This paper describes a weighted finite-state transducer composition algorithm that generalizes the concept of the composition filter and presents various filters that process epsilon transitions, look-ahead along paths, and push forward labels along epsilon paths. These filters, either individually or in combination, make it possible to compose some transducers much more efficiently in time and space than otherwise possible. We present examples of this drawn, in part, from demanding speech-processing applications. The generalized composition algorithm and many of these filters have been included in OpenFst, an open-source weighted transducer library.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allauzen, C., Mohri, M., Rastogi, A.: General algorithms for testing the ambiguity of finite automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 108–120. Springer, Heidelberg (2008)
Allauzen, C., Mohri, M., Riley, M.: Statistical modeling for unit selection in speech synthesis. In: Proc. ACL, pp. 55–62 (2004)
Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst: A general and efficient weighted finite-state transducer library. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 11–23. Springer, Heidelberg (2007), http://www.openfst.org
Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. of Computer and System Sci. 13, 335–379 (1976)
Caseiro, D., Trancoso, I.: A specialized on-the-fly algorithm for lexicon and language model composition. IEEE Trans. on Audio, Speech and Lang. Proc. 14(4), 1281–1291 (2006)
Cheng, O., Dines, J., Doss, M.: A generalized dynamic composition algorithm of weighted finite state transducers for large vocabulary speech recognition. In: Proc. ICASSP, vol. 4, pp. 345–348 (2007)
Dom, M., Niedermeier, R.: The search for consecutive ones submatrices: Faster and more general. In: Proc. ACID, pp. 43–54 (2007)
Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234, 59–84 (2000)
Hsu, W.-L., McConnell, R.: PC trees and circular-ones arrangements. Theor. Comput. Sci. 296(1), 99–116 (2003)
McDonough, J., Stoimenov, E., Klakow, D.: An algorithm for fast composition of weighted finite-state transducers. In: Proc. ASRU (2007)
Meidanis, J., Porto, O., Telles, G.: On the consecutive ones property. Discrete Appl. Math. 88, 325–354 (1998)
Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics 7(3), 321–350 (2002)
Mohri, M., Pereira, F., Riley, M.: Speech recognition with weighted finite-state transducers. In: Jacob Benesty, Y.H., Sondhi, M. (eds.) Handbook of Speech Processing, pp. 559–582. Springer, Heidelberg (2008)
Oonishi, T., Dixon, P., Iwano, K., Furui, S.: Implementation and evaluation of fast on-the-fly WFST composition algorithms. In: Proc. Interspeech, pp. 2110–2113 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allauzen, C., Riley, M., Schalkwyk, J. (2011). Filters for Efficient Composition of Weighted Finite-State Transducers. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-18098-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18097-2
Online ISBN: 978-3-642-18098-9
eBook Packages: Computer ScienceComputer Science (R0)