<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="shi-etal-2018-improving">
    <titleInfo>
        <title>Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Tianze</namePart>
        <namePart type="family">Shi</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Carlos</namePart>
        <namePart type="family">Gómez-Rodríguez</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Lillian</namePart>
        <namePart type="family">Lee</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2018-06</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers)</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Marilyn</namePart>
            <namePart type="family">Walker</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Heng</namePart>
            <namePart type="family">Ji</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Amanda</namePart>
            <namePart type="family">Stent</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">New Orleans, Louisiana</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We generalize Cohen, Gómez-Rodríguez, and Satta’s (2011) parser to a family of non-projective transition-based dependency parsers allowing polynomial-time exact inference. This includes novel parsers with better coverage than Cohen et al. (2011), and even a variant that reduces time complexity to O(n⁶), improving over the known bounds in exact inference for non-projective transition-based parsing. We hope that this piece of theoretical work inspires design of novel transition systems with better coverage and better run-time guarantees.</abstract>
    <identifier type="citekey">shi-etal-2018-improving</identifier>
    <identifier type="doi">10.18653/v1/N18-2067</identifier>
    <location>
        <url>https://aclanthology.org/N18-2067</url>
    </location>
    <part>
        <date>2018-06</date>
        <extent unit="page">
            <start>420</start>
            <end>425</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers
%A Shi, Tianze
%A Gómez-Rodríguez, Carlos
%A Lee, Lillian
%Y Walker, Marilyn
%Y Ji, Heng
%Y Stent, Amanda
%S Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers)
%D 2018
%8 June
%I Association for Computational Linguistics
%C New Orleans, Louisiana
%F shi-etal-2018-improving
%X We generalize Cohen, Gómez-Rodríguez, and Satta’s (2011) parser to a family of non-projective transition-based dependency parsers allowing polynomial-time exact inference. This includes novel parsers with better coverage than Cohen et al. (2011), and even a variant that reduces time complexity to O(n⁶), improving over the known bounds in exact inference for non-projective transition-based parsing. We hope that this piece of theoretical work inspires design of novel transition systems with better coverage and better run-time guarantees.
%R 10.18653/v1/N18-2067
%U https://aclanthology.org/N18-2067
%U https://doi.org/10.18653/v1/N18-2067
%P 420-425

Markdown (Informal)

[Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers](https://aclanthology.org/N18-2067) (Shi et al., NAACL 2018)

• Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers (Shi et al., NAACL 2018)

ACL

• Tianze Shi, Carlos Gómez-Rodríguez, and Lillian Lee. 2018. Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers), pages 420–425, New Orleans, Louisiana. Association for Computational Linguistics.