Files in this item
Calculating the optimal step of arc-eager parsing for non-projective trees
Item metadata
dc.contributor.author | Nederhof, Mark Jan | |
dc.date.accessioned | 2021-04-22T10:30:07Z | |
dc.date.available | 2021-04-22T10:30:07Z | |
dc.date.issued | 2021-04-19 | |
dc.identifier | 272452458 | |
dc.identifier | 794119bc-d383-40c6-8171-8a4b5fab3ac0 | |
dc.identifier | 85107290251 | |
dc.identifier | 000863557002029 | |
dc.identifier.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 > | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9781954085022 | |
dc.identifier.other | ORCID: /0000-0002-1845-6829/work/92774989 | |
dc.identifier.uri | https://hdl.handle.net/10023/23073 | |
dc.description.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'. | |
dc.format.extent | 363063 | |
dc.language.iso | eng | |
dc.publisher | Association for Computational Linguistics | |
dc.relation.ispartof | Proceedings of the 16th Conference of the European Chapter of the Association of Computational Linguistics (EACL 2021) | en |
dc.subject | P Language and Literature | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | NS | en |
dc.subject | NIS | en |
dc.subject.lcc | P | en |
dc.subject.lcc | QA75 | en |
dc.title | Calculating the optimal step of arc-eager parsing for non-projective trees | en |
dc.type | Conference item | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.url | https://www.aclweb.org/anthology/2021.eacl-main.193 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.