Abstract
It 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'.
Cite
CITATION STYLE
APA
Nederhof, M. J. (2021). Calculating the optimal step of arc-eager parsing for non-projective trees. In EACL 2021 - 16th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference (pp. 2273–2283). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2021.eacl-main.193
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free