N-best parsing revisited

Authors:
Matthias Büchse;Daniel Geisler;Torsten Stüber;Heiko Vogler
Affiliations:
Technische Universität, Dresden;Technische Universität, Dresden;Technische Universität, Dresden;Technische Universität, Dresden
Venue:
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Year:
2010

Citing 12
Cited 1

Weighted grammars and Kleene's theorem

Information Processing Letters
Weighted deductive parsing and Knuth's algorithm

Computational Linguistics
Formal tree series

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Semiring parsing

Computational Linguistics
Discriminative training and maximum entropy models for statistical machine translation

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A better N-best list: practical determinization of weighted finite tree automata

HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Finding the K shortest hyperpaths

Computers and Operations Research
Better k-best parsing

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Variational decoding for statistical machine translation

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
k-best A* parsing

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Parsing algorithms based on tree automata

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences

Tree parsing with synchronous tree-adjoining grammars

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 show experimental results concerning its runtime. Our work is different from the aforementioned one in the following respects: we consider labeled hypergraphs, allowing for tree-based language models (Maletti and Satta, 2009); we specifically handle the case of cyclic hypergraphs; we admit structured weight domains, allowing for multiple features to be processed; we use the paradigm of functional programming together with lazy evaluation, achieving concise algorithmic descriptions.