Calculating the optimal step of arc-eager parsing for non-projective trees
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'.
Citation
Nederhof , M J 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 of Computational Linguistics (EACL 2021) . Association for Computational Linguistics , pp. 2273–2283 , 16th Conference of the European Chapter of the ACL , Kyiv , Ukraine , 19/04/21 . < https://www.aclweb.org/anthology/2021.eacl-main.193 > conference
Publication
Proceedings of the 16th Conference of the European Chapter of the Association of Computational Linguistics (EACL 2021)
Type
Conference item
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.