Dynamic programming algorithms for transition-based dependency parsers

Authors:
Marco Kuhlmann;Carlos Gómez-Rodríguez;Giorgio Satta
Affiliations:
Uppsala University, Sweden;Universidade da Coruña, Spain;University of Padua, Italy
Venue:
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Year:
2011

Citing 14
Cited 4

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Deterministic Techniques for Efficient Non-Deterministic Parsers

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Semiring parsing

Computational Linguistics
The structure of shared forests in ambiguous parsing

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A new statistical parser based on bigram lexical dependencies

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Efficient parsing for bilexical context-free grammars and head automaton grammars

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Inductive Dependency Parsing (Text, Speech and Language Technology)

Inductive Dependency Parsing (Text, Speech and Language Technology)
Algorithms for deterministic incremental dependency parsing

Computational Linguistics
Experiments with a multilanguage non-projective dependency parser

CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Incrementality in deterministic dependency parsing

IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
A tale of two parsers: investigating and combining graph-based and transition-based dependency parsing using beam-search

EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
First- and second-order expectation semirings with applications to minimum-risk training on translation forests

EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
Bilingually-constrained (monolingual) shift-reduce parsing

EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
Dynamic programming for linear-time incremental parsing

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics

Exact inference for generative probabilistic non-projective dependency parsing

EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
The best of both worlds: a graph-based completion model for transition-based parsers

EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Vine pruning for efficient multi-pass dependency parsing

NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Divisible transition systems and multiplanar dependency parsing

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a general dynamic programming technique for the tabulation of transition-based dependency parsers, and apply it to obtain novel, polynomial-time algorithms for parsing with the arc-standard and arc-eager models. We also show how to reverse our technique to obtain new transition-based dependency parsers from existing tabular methods. Additionally, we provide a detailed discussion of the conditions under which the feature models commonly used in transition-based parsing can be integrated into our algorithms.