An Efficient Algorithm for the n-Best-Strings Problem (2002)

Cached

Download Links

by Mehryar Mohri , Michael Riley
Venue:In Proceedings of the International Conference on Spoken Language Processing 2002 (ICSLP ’02
Citations:12 - 1 self

Documents Related by Co-Citation

50 A generalization of Dijkstra’s algorithm – Donald Knuth - 1977
11 Weighted deductive parsing and Knuth’s algorithm – Mark-Jan Nederhof
81 Training Tree Transducers – Jonathan Graehl, Kevin Knight - 2004
21 Coarse-to-fine-grained n-best parsing and discriminative reranking – Eugene Charniak, Mark Johnson - 2005
9 Finding the k shortest hyperpaths – Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
466 Automatic labeling of semantic roles – Daniel Gildea - 2002
74 Directed Hypergraphs And Applications – Giorgio Gallo, Giustino Longo, Sang Nguyen, Stefano Pallottino - 1992
150 Principles and implementation of deductive parsing – Stuart M. Shieber, Yves Schabes, Fernando C. N. Pereira - 1995
156 Online large-margin training of dependency parsers – Ryan Mcdonald, Koby Crammer, Fernando Pereira - 2005
7324 Cache-oblivious algorithms – M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN - 1999
257 A hierarchical phrase-based model for statistical machine translation – David Chiang - 2005
1011 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
103 Better k-best parsing – Liang Huang - 2005
245 The alignment template approach to statistical machine translation – Franz Josef Och, Hermann Ney - 2004
671 A Maximum-Entropy-Inspired Parser – Eugene Charniak - 1999
780 Head-Driven Statistical Models for Natural Language Parsing – Michael Collins - 2003
42 Parsing and hypergraphs – Dan Klein, Christopher D. Manning - 2001
1965 Dynamic Programming – R Bellman - 1957
255 Combinatorial Optimization: Networks and – E Lawler - 1976