Learning to Parse Natural Language with Maximum Entropy Models
Machine Learning - Special issue on natural language learning
Discriminative Reranking for Natural Language Parsing
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Parsing inside-out
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
A parsing: fast exact Viterbi parse selection
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Minimum error rate training in statistical machine translation
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Learning accurate, compact, and interpretable tree annotation
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Scalable inference and training of context-rich syntactic translation models
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Effective self-training for parsing
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Hierarchical search for parsing
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
The generalized A* architecture
Journal of Artificial Intelligence Research
Factored A* search for models over sequences and trees
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Querying parse trees of stochastic context-free grammars
Proceedings of the 13th International Conference on Database Theory
Efficient inference through cascades of weighted tree transducers
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Attempts to verify written English
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
Efficient CCG parsing: A* versus adaptive supertagging
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
K*: A heuristic search algorithm for finding the k shortest paths
Artificial Intelligence
Constructing efficient information extraction pipelines
Proceedings of the 20th ACM international conference on Information and knowledge management
Discontinuous data-oriented parsing: a mildly context-sensitive all-fragments grammar
SPMRL '11 Proceedings of the Second Workshop on Statistical Parsing of Morphologically Rich Languages
Deciding the twins property for weighted tree automata over extremal semifields
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Iterative viterbi A* algorithm for k-best sequential decoding
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Automatic pipeline construction for real-time annotation
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
| Hi-index | 0.00 |
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 can be extracted significantly faster than with other approaches, over a range of grammar types.