<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="kummerfeld-klein-2017-parsing">
    <titleInfo>
        <title>Parsing with Traces: An O(n4) Algorithm and a Structural Representation</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Jonathan</namePart>
        <namePart type="given">K</namePart>
        <namePart type="family">Kummerfeld</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Dan</namePart>
        <namePart type="family">Klein</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2017</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre authority="bibutilsgt">journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>Transactions of the Association for Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <issuance>continuing</issuance>
            <publisher>MIT Press</publisher>
            <place>
                <placeTerm type="text">Cambridge, MA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">periodical</genre>
        <genre authority="bibutilsgt">academic journal</genre>
    </relatedItem>
    <abstract>General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible enough to cover almost all treebank structures, while still admitting efficient learning and inference. In particular, we consider directed, acyclic, one-endpoint-crossing graph structures, which cover most long-distance dislocation, shared argumentation, and similar tree-violating linguistic phenomena. We describe how to convert phrase structure parses, including traces, to our new representation in a reversible manner. Our dynamic program uniquely decomposes structures, is sound and complete, and covers 97.3% of the Penn English Treebank. We also implement a proof-of-concept parser that recovers a range of null elements and trace types.</abstract>
    <identifier type="citekey">kummerfeld-klein-2017-parsing</identifier>
    <identifier type="doi">10.1162/tacl_a_00072</identifier>
    <location>
        <url>https://aclanthology.org/Q17-1031</url>
    </location>
    <part>
        <date>2017</date>
        <detail type="volume"><number>5</number></detail>
        <extent unit="page">
            <start>441</start>
            <end>454</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Parsing with Traces: An O(n4) Algorithm and a Structural Representation
%A Kummerfeld, Jonathan K.
%A Klein, Dan
%J Transactions of the Association for Computational Linguistics
%D 2017
%V 5
%I MIT Press
%C Cambridge, MA
%F kummerfeld-klein-2017-parsing
%X General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible enough to cover almost all treebank structures, while still admitting efficient learning and inference. In particular, we consider directed, acyclic, one-endpoint-crossing graph structures, which cover most long-distance dislocation, shared argumentation, and similar tree-violating linguistic phenomena. We describe how to convert phrase structure parses, including traces, to our new representation in a reversible manner. Our dynamic program uniquely decomposes structures, is sound and complete, and covers 97.3% of the Penn English Treebank. We also implement a proof-of-concept parser that recovers a range of null elements and trace types.
%R 10.1162/tacl_a_00072
%U https://aclanthology.org/Q17-1031
%U https://doi.org/10.1162/tacl_a_00072
%P 441-454

Markdown (Informal)

[Parsing with Traces: An O(n4) Algorithm and a Structural Representation](https://aclanthology.org/Q17-1031) (Kummerfeld & Klein, TACL 2017)

• Parsing with Traces: An O(n4) Algorithm and a Structural Representation (Kummerfeld & Klein, TACL 2017)

ACL

• Jonathan K. Kummerfeld and Dan Klein. 2017. Parsing with Traces: An O(n4) Algorithm and a Structural Representation. Transactions of the Association for Computational Linguistics, 5:441–454.