Mehryar Mohri, Michael Riley  Home/Search
Context Related
| att.com/~mohri/postscript/nbest.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: att.com/~mohri/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: problem in a weighted automaton. This problem arises commonly in speech recognition applications when a ranked list of unique recognizer hypotheses is desired. We believe this is the first n-best algorithm to remove redundant hypotheses before rather than after the n-best determination. We give a detailed description of the algorithm and demonstrate its correctness. We report experimental results showing its efficiency and practicality even for large n in a 40; 000-word vocabulary North... (Update)
Cited by: More
Word Graphs for Statistical Machine Translation - Zens, Ney (2005) (Correct)
Active bibliography (related documents): More All
0.7: Weighted Finite-State Transducers in Speech Recognition - Mohri, Pereira, Riley (2000) (Correct)
0.7: Edit-Distance of Weighted Automata - Mohri (2002) (Correct)
0.4: A Weight Pushing Algorithm for Large Vocabulary Speech.. - Mehryar Mohri Michael (2001) (Correct)
Similar documents based on text: More All
0.6: Weighted Determinization and Minimization for Large Vocabulary .. - Mohri, Riley (1997) (Correct)
0.6: Transducer Composition for Context-Dependent Network Expansion - Riley, Pereira, Mohri (1997) (Correct)
0.6: Integrated Context-Dependent Networks in Very Large Vocabulary .. - Mohri, Riley (1999) (Correct)
BibTeX entry: (Update)
M. Mohri and M. Riley. 2002. An efficient algorithm for the nbest -strings problem. In Proc. of the 7th Int. Conf. on Spoken Language Processing (ICSLP'02), pages 1313--1316, Denver, CO, September. http://citeseer.ist.psu.edu/article/mohri02efficient.html More
@misc{ mohri02efficient,
author = "M. Mohri and M. Riley",
title = "An efficient algorithm for the nbest -strings problem",
text = "M. Mohri and M. Riley. 2002. An efficient algorithm for the nbest -strings
problem. In Proc. of the 7th Int. Conf. on Spoken Language Processing (ICSLP'02),
pages 1313--1316, Denver, CO, September.",
year = "2002",
url = "citeseer.ist.psu.edu/article/mohri02efficient.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1992
866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
327 Languages and Machines (context) - Eilenberg
107 Finite-State Transducers in Language and Speech Processing - Mohri - 1997
104 Automata-Theoretic Aspects of Formal Power Series (context) - Salomaa, Soittola - 1978
38 A Tree-Trellis Based Fast Search for Finding the N Best Sent.. (context) - Soong, Huang - 1991
22 Finding the k shortest paths - Eppstein - 1998
20 Number 5 in EATCS Monographs on Theoretical Computer Science (context) - Kuich, Salomaa et al. - 1986
15 Teubner Studienbucher: Stuttgart (context) - Berstel, Context-Free - 1979
13 General Algebraic Frameworks and Algorithms for Shortest-Dis.. (context) - Mohri - 1998
11 General-purpose Finite-State Machine Software Tools (context) - Mehryar, Pereira et al. - 1997
10 and R Schwartz, "The N-Best Algorithm: An Efficient Procedur.. (context) - Chow - 1990
7 Network optimizations for large vocabulary speech recognitio.. - Mohri, Riley - 1998
6 Springer-Verlag: Berlin-New York (context) - Berstel, Reutenauer et al. - 1988
4 Efficient general lattice generation and rescoring (context) - Ljolje, Pereira et al. - 1999
4 the Determinizability of Weighted Automata and Transducers - Allauzen, Mohri - 2002
1 K shortest paths and other (context) - Eppstein - 2001
Documents on the same site (http://www.research.att.com/~mohri/pub.html): More
String-Matching With Automata - Mohri (1997) (Correct)
Weighted Automata in Text and Speech Processing - Mohri, Pereira, Riley (1996) (Correct)
Dynamic Compilation of Weighted Context-Free Grammars - Mohri, Pereira (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC