Constrained Arc-Eager Dependency Parsing

Joakim Nivre, Yoav Goldberg, Ryan Mcdonald

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


Arc-eager dependency parsers process sentences in a single left-to-right pass over the input and have linear time complexity with greedy decoding or beam search. We show how such parsers can be constrained to respect two different types of conditions on the output dependency graph: span constraints, which require certain spans to correspond to subtrees of the graph, and arc constraints, which require certain arcs to be present in the graph. The constraints are incorporated into the arc-eager transition system as a set of preconditions for each transition and preserve the linear time complexity of the parser.

Original languageEnglish
Pages (from-to)249-257
Number of pages9
JournalComputational Linguistics
Issue number2
StatePublished - Jun 2014


Dive into the research topics of 'Constrained Arc-Eager Dependency Parsing'. Together they form a unique fingerprint.

Cite this