Abstract

We discuss the relevance of k-best parsing to recent applications in natural language processing, and develop efficient algorithms for k-best trees in the framework of hypergraph parsing. To demonstrate the efficiency, scalability and accuracy of these algorithms, we present experiments on Bikel’s implementation of Collins ’ lexicalized PCFG model, and on Chiang’s CFG-based decoder for hierarchical phrase-based translation. We show in particular how the improved output of our algorithms has the potential to improve results from parse reranking systems and other applications. 1

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
5666	Probabilistic reasoning in intelligent systems - Pearl - 1988
1654	B.: Building a large annotated corpus of english: The Penn treebank - Marcus, Marcinkiewicz, et al. - 1993
780	Head-Driven Statistical Models for Natural Language Parsing - Collins - 1999
671	A Maximum-Entropy-Inspired Parser - Charniak - 2000
466	Automatic Labeling of Semantic Roles - Gildea, Jurafsky - 2002
282	Lattice-based minimum error rate training for statistical machine translation - Macherey, Och, et al. - 2008
257	A hierarchical phrase-based model for statistical machine translation - Chiang - 2005
245	The alignment template approach to statistical machine translation - Och, Ney - 2004
220	Discriminative Reranking for Natural Language Parsing - Collins - 2000
156	Online large-margin training of dependency parsers - McDonald, Crammer, et al. - 2005
150	Principles and implementation of deductive parsing - Shieber, Schabes, et al. - 1995
142	A Linear Observed Time Statistical Parser Based on Maximum Entropy Models - Ratnaparkhi - 1997
114	Max-margin parsing - Taskar, Klein, et al. - 2004
87	Intricacies of Collins’ parsing model - Bikel - 2004
78	Minimum Bayes-risk decoding for statistical machine translation - Kumar, Byrne - 2004
74	Directed Hypergraph and Applications - Gallo, Longo, et al. - 1993
65	Parsing Inside-Out - Goodman - 1998
53	An overview of probabilistic tree transducers for natural language processing - Knight, Graehl - 2005
51	Semiring frameworks and algorithms for shortest-distance problems - Mohri
50	Semiring parsing - Goodman - 1998
50	A generalization of Dijkstra’s algorithm - Knuth - 1977
43	Discriminative reranking for machine translation - Shen, Sarkar, et al. - 2004
42	Parsing and hypergraphs - Klein, Manning - 2001
41	Compositional Semantics with Lexicalized Tree-Adjoining Grammar (LTAG): How Much Underspecification is - Joshi, Vijay-Shanker - 1999
40	Bilexical grammars and their cubic-time parsing algorithms - Eisner - 2000
39	Case-factor diagrams for structured probability models - McAllester, Collins, et al. - 2004
34	Parsing with the shortest derivation - Bod - 2000
31	Representation-based just-in-time specialization and the Psyco prototype for Python - Rigo - 2004
22	Joint parsing and semantic role labeling - Sutton, McCallum - 2005
21	Coarse-to-fine-grained n-best parsing and discriminative reranking - Charniak, Johnson - 2005
15	A comparative study of k-shortest path algorithms - Brander, Sinclair - 1996
12	An efficient algorithm for the n-best-strings problem - Mohri, Riley - 2002
11	Weighted deductive parsing and Knuth’s algorithm - Nederhof
9	Finding the k shortest hyperpaths - Nielsen, Andersen, et al. - 2005
7	Method and system for natural language translation - Brown, Cocke, et al. - 1995
6	On computing sets of shortest paths in a graph - Minieka - 1974
5	Computation of the n best parse trees for weighted and stochastic context-free grammars - Jimenez, Marzal
5	Comment on computing the k shortest paths in a graph - Lawler - 1977
3	Bibliography on k Shortest Paths and other k Best Solutions Problems,” http://www.ics.uci.edu/�eppstein/bibs/kpath.bib - Eppstein