Constrained Arc-Eager Dependency Parsing
2014 (English)In: Computational linguistics - Association for Computational Linguistics (Print), ISSN 0891-2017, E-ISSN 1530-9312, Vol. 40, no 2, 249-257 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2014. Vol. 40, no 2, 249-257 p.
Computer and Information Science General Language Studies and Linguistics
IdentifiersURN: urn:nbn:se:uu:diva-229456DOI: 10.1162/COLI_a_00184ISI: 000338196000001OAI: oai:DiVA.org:uu-229456DiVA: diva2:736620