A generalized composition algorithm for weighted finite-state transducers

Proceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH

Volumn , Issue , 2009, Pages 1203-1206

  Allauzen, Cyril ^a   Riley, Michael ^a   Schalkwyk, Johan ^a  

^a GOOGLE INC   (United States)

Author keywords

LVCSR; WFST

Indexed keywords

BROADCAST NEWS; COMPOSITION FILTERS; CONTEXT DEPENDENT; LANGUAGE MODEL; OFFLINE; QUERY TASKS; RUNTIMES; TIME AND SPACE; WEIGHTED FINITE-STATE TRANSDUCERS;

COMPUTATIONAL LINGUISTICS; PIEZOELECTRIC TRANSDUCERS; SPEECH COMMUNICATION; WEB SERVICES;

SPEECH RECOGNITION;

EID: 70450183653     PISSN: None     EISSN: 19909772     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. M. Mohri, F. Pereira, and M. Riley, "Speech recognition with weighted finite-state transducers," in Handbook of Speech Processing, Y. H. Jacob Benesty, Mohan Sondhi, Ed. Springer, 2008, pp. 559-582.
2. D. Caseiro and I. Trancoso, "A specialized on-the-fly algorithm for lexicon and language model composition," in IEEE Trans. on Audio, Speech and Lang. Proc., vol. 14, no. 4, 2006, pp. 1281-1291.
3. O. Cheng, J. Dines, and M. Doss, "A generalized dynamic composition algorithm of weighted finite state transducers for large vocabulary speech recognition," in Proc. ICASSP, vol. 4, 2007, pp. 345-348.
4. T. Oonishi, P. Dixon, K. Iwano, and S. Furui, "Implementation and evaluation of fast on-the-fly wfst composition algorithms," in Proc. Interspeech, 2008, pp. 2110-2113.
5. K. Booth and G. Lueker, "Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms," J. of Computer and System Sci., vol. 13, pp. 335-379, 1976.
6. M. Habib, R. McConnell, C. Paul, and L. Viennot, "Lex-BFS and partition refinement with appli- cations to transitive orientation, interval graph recognition and consecutive ones testing," Theor. Comput. Sci., vol. 234, pp. 59-84, 2000.
7. W.-L. Hsu and R. McConnell, "PC trees and circular-ones arrangements," Theor. Comput. Sci., vol. 296, no. 1, pp. 99-116, 2003.
8. J. Meidanis, O. Porto, and G. Telles, "On the consecutive ones property," Discrete Appl. Math., vol. 88, pp. 325-354, 1998.
9. M. Dom and R. Niedermeier, "The search for consecutive ones submatrices: Faster and more general," in ACID, 2007, pp. 43-54.
10. C. Allauzen, M. Riley, J. Schalkwyk, W. Skut, and M. Mohri, "OpenFst Library," http://www.openfst.org, 2007.