@inproceedings{nederhof-2021-calculating,
title = "Calculating the optimal step of arc-eager parsing for non-projective trees",
author = "Nederhof, Mark-Jan",
editor = "Merlo, Paola and
Tiedemann, Jorg and
Tsarfaty, Reut",
booktitle = "Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume",
month = apr,
year = "2021",
address = "Online",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2021.eacl-main.193",
doi = "10.18653/v1/2021.eacl-main.193",
pages = "2273--2283",
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{'}.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="nederhof-2021-calculating">
<titleInfo>
<title>Calculating the optimal step of arc-eager parsing for non-projective trees</title>
</titleInfo>
<name type="personal">
<namePart type="given">Mark-Jan</namePart>
<namePart type="family">Nederhof</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2021-04</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume</title>
</titleInfo>
<name type="personal">
<namePart type="given">Paola</namePart>
<namePart type="family">Merlo</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Jorg</namePart>
<namePart type="family">Tiedemann</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Reut</namePart>
<namePart type="family">Tsarfaty</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Online</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<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’.</abstract>
<identifier type="citekey">nederhof-2021-calculating</identifier>
<identifier type="doi">10.18653/v1/2021.eacl-main.193</identifier>
<location>
<url>https://aclanthology.org/2021.eacl-main.193</url>
</location>
<part>
<date>2021-04</date>
<extent unit="page">
<start>2273</start>
<end>2283</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Calculating the optimal step of arc-eager parsing for non-projective trees
%A Nederhof, Mark-Jan
%Y Merlo, Paola
%Y Tiedemann, Jorg
%Y Tsarfaty, Reut
%S Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume
%D 2021
%8 April
%I Association for Computational Linguistics
%C Online
%F nederhof-2021-calculating
%X 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’.
%R 10.18653/v1/2021.eacl-main.193
%U https://aclanthology.org/2021.eacl-main.193
%U https://doi.org/10.18653/v1/2021.eacl-main.193
%P 2273-2283
Markdown (Informal)
[Calculating the optimal step of arc-eager parsing for non-projective trees](https://aclanthology.org/2021.eacl-main.193) (Nederhof, EACL 2021)
ACL