An efficient algorithm for the TV-best-strings problem

7th International Conference on Spoken Language Processing, ICSLP 2002

Volumn , Issue , 2002, Pages 1313-1316

  Mohri, Mehryar ^a   Riley, Michael ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM FOR SOLVING; ITS EFFICIENCIES; LARGE N; LATTICE GENERATIONS; NOCV2; NORTH AMERICAN BUSINESS; WEIGHTED AUTOMATA;

SPEECH RECOGNITION;

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

References (17)

1. David Eppstein, "K shortest paths and other "k best" problems", http://www1.ics.uci.edureppstein/bibs/kpath.bib, 2001.
2. David Eppstein, "Finding the k shortest paths", SIAM J. Computing, vol. 28, no. 2, pp. 652-673, 1998.
3. Y. Chow and R. Schwartz, "The N-Best Algorithm: An Efficient Procedure for Finding top N Sentence Hypotheses", in Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP'90), Albuquerque, New Mexico, April 1990, pp. 81-84.
4. Frank Soong and Eng-Fong Huang, "A Tree-Trellis Based Fast Search for Finding the N Best Sentence Hypotheses in Continuous Speech Recognition", in Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP'91), Toronto, Canada, November 1991, pp. 705-708.
5. Mehryar Mohri, "Finite-State Transducers in Language and Speech Processing", Computational Linguistics, vol. 23:2, 1997.
6. Mehryar Mohri and Michael Riley, "Network optimizations for large vocabulary speech recognition", Speech Communication, vol. 25:3, 1998.
7. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, The MIT Press: Cambridge, MA, 1992.
8. A. Ljolje and F. Pereira and M. Riley, "Efficient general lattice generation and rescoring", in Proceedings of the European Conference on Speech Communication and Technology (Eurospeech'99), Budapest, Hungary, 1999.
9. Jean Berstel and Christophe Reutenauer, Rational Series and Their Languages, Springer-Verlag: Berlin-New York, 1988.
10. Arto Salomaa and Matti Soittola, Automata-Theoretic Aspects of Formal Power Series, Springer-Verlag: New York, 1978.
11. Jean Berstel, Transductions and Context-Free Languages, Teubner Studienbucher: Stuttgart, 1979.
12. Samuel Eilenberg, Automata, Languages and Machines, vol. A-B, Academic Press, 1974-1976.
13. Werner Kuich and Arto Salomaa, Semirings, Automata, Languages, Number 5 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1986.
14. Cyril Allauzen and Mehryar Mohri, "On the Determinizability of Weighted Automata and Transducers", in Proceedings of the workshop Weighted Automata: Theory and Applications (WATA), Dresden, Germany, March 2002.
15. Alfred V Aho, Ravi Sethi, and Jeffrey D. Ullman, Compilers, Principles, Techniques and Tools, Addison Wesley: Reading, MA, 1986.
16. Mehryar Mohri, "General Algebraic Frameworks and Algorithms for Shortest-Distance Problems", Technical Memorandum 981210-10TM, AT&T Labs - Research, 62 pages, 1998.
17. Mohri, Mehryar and Fernando C. N. Pereira and Michael Riley, "General-purpose Finite-State Machine Software Tools", http://www.research.att.com/sw/tools/fsm, vol. AT&T Labs - Research, 1997.