K-Best A* Parsing

@inproceedings{Pauls2009KBestAP,
  title={K-Best A* Parsing},
  author={Adam Pauls and Dan Klein},
  booktitle={ACL},
  year={2009}
}
A* parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing k-best extraction methods can efficiently search for top derivations, but only after an exhaustive 1-best pass. We present a unified algorithm for k-best A* parsing which preserves the efficiency of k-best extraction while giving the speed-ups of A* methods. Our algorithm produces optimal k-best parses under the same conditions required for optimality in a 1-best A* parser. Empirically, optimal k-best lists… 

Figures from this paper

Top-Down K-Best A* Parsing
TLDR
The proposed algorithm, TKA* is a variant of the k-best A* (KA*) algorithm of Pauls and Klein (2009), which maintains the same optimality and efficiency guarantees of KA*, but is simpler to both specify and implement.
K-best Iterative Viterbi Parsing
TLDR
This paper presents an efficient and optimal parsing algorithm for probabilistic context-free grammars (PCFGs) that employs a pruning technique to reduce unnecessary edges in the search space and how to extend this algorithm to extract k-best Viterbi parse trees.
Efficient CCG Parsing: A* versus Adaptive Supertagging
TLDR
A systematic comparison and combination of two orthogonal techniques for efficient parsing of Combinatory Categorial Grammar (CCG) and what is believed to be the first evaluation of A* parsing on the more realistic but more stringent metric of CPU time.
Discontinuous Data-Oriented Parsing: A mildly context-sensitive all-fragments grammar
TLDR
This work applies Data-Oriented Parsing (DOP) to a grammar formalism that allows for discontinuous trees (LCFRS), and finds that the model is reasonably efficient, and surpasses the state of the art in discontinuous parsing.
Explorer Efficient CCG Parsing : A * versus Adaptive Supertagging
TLDR
A systematic comparison and combination of two orthogonal techniques for efficient parsing of Combinatory Categorial Grammar (CCG) and what is believed to be the first evaluation of A* parsing on the more realistic but more stringent metric of CPU time.
Global Neural CCG Parsing with Optimality Guarantees
TLDR
This work introduces the first global recursive neural parsing model with optimality guarantees during decoding, and shows it is possible to learn an efficient A* parser.
Promoting multiword expressions in A* TAG parsing
TLDR
It is shown that for some MWE types idiomatic readings are usually the correct ones, and a heuristic is proposed for an A* parser for Tree Adjoining Grammars which benefits from this knowledge by promoting MWE-oriented analyses.
Iterative Viterbi A* Algorithm for K-Best Sequential Decoding
TLDR
It is shown that iterative Viterbi A* decoding can be several times or orders of magnitude faster than the state-of-the-art algorithm for tagging tasks with a large number of labels, which makes real-time large-scale tagging applications with thousands of labels feasible.
n-Best Parsing Revisited
We derive and implement an algorithm similar to (Huang and Chiang, 2005) for finding the n best derivations in a weighted hypergraph. We prove the correctness and termination of the algorithm and we
Constrained Decoding for Text-Level Discourse Parsing
This paper presents a novel approach to document-based discourse analysis by performing a global A* search over the space of possible structures while optimizing a global criterion over the set of
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
Better k-best Parsing
TLDR
It is shown how the improved output of the efficient algorithms for k-best trees in the framework of hypergraph parsing has the potential to improve results from parse reranking systems and other applications.
Hierarchical Search for Parsing
TLDR
This work presents the first experiments on hierarchical A* parsing, in which computation of heuristics is itself guided by meta-heuristics, and demonstrates the tradeoffs and relative strengths of each method.
A* Parsing: Fast Exact Viterbi Parse Selection
TLDR
This work presents an extension of the classic A* search procedure to tabular PCFG parsing, which is simpler to implement than an upward-propagating best-first parser, is correct for a wide range of parser control strategies and maintains worst-case cubic time.
Coarse-to-Fine n-Best Parsing and MaxEnt Discriminative Reranking
TLDR
This paper describes a simple yet novel method for constructing sets of 50- best parses based on a coarse-to-fine generative parser that generates 50-best lists that are of substantially higher quality than previously obtainable.
Effective Self-Training for Parsing
We present a simple, but surprisingly effective, method of self-training a two-phase parser-reranker system using readily available unlabeled data. We show that this type of bootstrapping is possible
Approximate Factoring for A* Search
TLDR
This work presents a novel method for creating A∗ estimates for structured search problems using an optimization framework to estimate parameters for these projections in a way which bounds the true costs.
Factored A* Search for Models over Sequences and Trees
TLDR
This work investigates the calculation of A* bounds for sequence and tree models which are the explicit intersection of a set of simpler models or can be bounded by such an intersection and shows that this factorization gives a modular lexicalized parser which is simpler than comparably accurate non-factored models, and which allows efficient exact inference with large treebank grammars.
An efficient context-free parsing algorithm
TLDR
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described and appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.
Computation of the N Best Parse Trees for Weighted and Stochastic Context-Free Grammars
TLDR
An efficient algorithm is proposed to solve one of the problems associated to the use of weighted and stochastic Context-Free Grammars: the problem of computing the N best parse trees of a given string.
Fast Exact Inference with a Factored Model for Natural Language Parsing
TLDR
A novel generative model for natural language tree structures in which semantic and syntactic structures are scored with separate models that admits an extremely effective A* parsing algorithm, which enables efficient, exact inference.
...
1
2
3
...