Quarterly (March, June, September, December)
160 pp. per issue
6 3/4 x 10
ISSN
0891-2017
E-ISSN
1530-9312
2014 Impact factor:
1.23

Computational Linguistics

Hwee Tou Ng, Editor
June 2014, Vol. 40, No. 2, Pages 249-527
(doi: 10.1162/COLI_a_00184)
@ 2014 Association for Computational Linguistics
Constrained Arc-Eager Dependency Parsing
Article PDF (166.73 KB)
Abstract

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.