Skip to content
conftrace_
2021 EACL EACL 2021

Calculating the optimal step of arc-eager parsing for non-projective trees

Abstract

AbstractIt is shown that the optimal next step of an arc-eager parser relative to a non-projective dependency structure can be calculated in cubic time, solving an open problem in parsing theory. Applications are in training of parsers by means of a ‘dynamic oracle’.

Authors

Mark-Jan Nederhof

Topics

Mathematics & Optimization > Mathematics > Discrete Mathematics Mathematics & Optimization > Optimization > Combinatorial Optimization

Keywords

dependency parsing dynamic oracle non-projective tree arc-eager parsing cubic time algorithm parsing theory
Download PDF

More from EACL 2021

All EACL 2021 papers →
Stereotype and Skew: Quantifying Gender Bias in Pre-trained and Fine-tuned Language Models
On the evolution of syntactic information encoded by BERT’s contextualized representations
Identify, Align, and Integrate: Matching Knowledge Graphs to Commonsense Reasoning Tasks
Subword Pooling Makes a Difference
Content-based Models of Quotation
L2C: Describing Visual Differences Needs Semantic Understanding of Individuals