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’.- Anthology ID:
- 2021.eacl-main.193
- Volume:
- Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume
- Month:
- April
- Year:
- 2021
- Address:
- Online
- Editors:
- Paola Merlo, Jorg Tiedemann, Reut Tsarfaty
- Venue:
- EACL
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 2273–2283
- Language:
- URL:
- https://aclanthology.org/2021.eacl-main.193
- DOI:
- 10.18653/v1/2021.eacl-main.193
- Cite (ACL):
- Mark-Jan Nederhof. 2021. Calculating the optimal step of arc-eager parsing for non-projective trees. In Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, pages 2273–2283, Online. Association for Computational Linguistics.
- Cite (Informal):
- Calculating the optimal step of arc-eager parsing for non-projective trees (Nederhof, EACL 2021)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-1/2021.eacl-main.193.pdf