<?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-apr</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>
        <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-apr</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
%S Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume
%D 2021
%8 apr
%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)

• Calculating the optimal step of arc-eager parsing for non-projective trees (Nederhof, EACL 2021)

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.