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

Mark Jan Nederhof

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

Mark Jan Nederhof

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Downloads (Pure)

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'.

Original language	English
Title of host publication	Proceedings of the 16th Conference of the European Chapter of the Association of Computational Linguistics (EACL 2021)
Publisher	Association for Computational Linguistics
Pages	2273–2283
ISBN (Print)	9781954085022
Publication status	Published - 19 Apr 2021
Event	16th Conference of the European Chapter of the ACL - Online, Kyiv, Ukraine Duration: 19 Apr 2021 → 23 Apr 2021 Conference number: 16 https://2021.eacl.org/

Conference

Conference	16th Conference of the European Chapter of the ACL
Abbreviated title	EACL 2021
Country/Territory	Ukraine
City	Kyiv
Period	19/04/21 → 23/04/21
Internet address	https://2021.eacl.org/

Access to Document

Nederhof-2021-Calculating-the-optimal-step-EACL-2273-CCBY
Copyright © 2021 Association for Computational Linguistics, licensed on a Creative Commons Attribution 4.0 International License.
Final published version, 355 KBLicence: CC BY

https://www.aclweb.org/anthology/2021.eacl-main.193

Cite this

@inproceedings{794119bcd38340c681718a4b5fab3ac0,

title = "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'.",

author = "Nederhof, {Mark Jan}",

year = "2021",

month = apr,

day = "19",

language = "English",

isbn = "9781954085022",

pages = "2273–2283",

booktitle = "Proceedings of the 16th Conference of the European Chapter of the Association of Computational Linguistics (EACL 2021)",

publisher = "Association for Computational Linguistics",

note = "16th Conference of the European Chapter of the ACL, EACL 2021 ; Conference date: 19-04-2021 Through 23-04-2021",

url = "https://2021.eacl.org/",

}

Nederhof, MJ 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>

Calculating the optimal step of arc-eager parsing for non-projective trees. / Nederhof, Mark Jan.
Proceedings of the 16th Conference of the European Chapter of the Association of Computational Linguistics (EACL 2021). Association for Computational Linguistics, 2021. p. 2273–2283.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Nederhof, Mark Jan

N1 - Conference code: 16

PY - 2021/4/19

Y1 - 2021/4/19

N2 - 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'.

AB - 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'.

M3 - Conference contribution

SN - 9781954085022

SP - 2273

EP - 2283

BT - Proceedings of the 16th Conference of the European Chapter of the Association of Computational Linguistics (EACL 2021)

PB - Association for Computational Linguistics

T2 - 16th Conference of the European Chapter of the ACL

Y2 - 19 April 2021 through 23 April 2021

ER -

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

Abstract

Conference

Access to Document

Fingerprint

Cite this