Constrained Arc-Eager Dependency Parsing
Bibliographic Data
| ID | 12155733 |
|---|---|
| Authors | Joakim Nivre (0000-0002-7873-3971, Uppsala University, corresponding author), Yoav Goldberg (0000-0002-6497-829X, Bar-Ilan University), Ryan McDonald (0000-0001-5346-5336, Google) |
| Language | EN |
| Citations received | 2 |
| References cited | 8 |
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
Algorithm · Arc (geometry · Beam search · Decoding methods · Dependency (UML · Graph · Parsing · Search algorithm · Time complexity · Transition system · Computer Science · Logic, programming, and type systems · Mathematics · Natural Language Processing Techniques · semigroups and automata theory · Artificial Intelligence · Theoretical Computer Science
| Highly cited | No |
|---|