<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="kuhlmann-jonsson-2015-parsing">
    <titleInfo>
        <title>Parsing to Noncrossing Dependency Graphs</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Marco</namePart>
        <namePart type="family">Kuhlmann</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Peter</namePart>
        <namePart type="family">Jonsson</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2015</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>We study the generalization of maximum spanning tree dependency parsing to maximum acyclic subgraphs. Because the underlying optimization problem is intractable even under an arc-factored model, we consider the restriction to noncrossing dependency graphs. Our main contribution is a cubic-time exact inference algorithm for this class. We extend this algorithm into a practical parser and evaluate its performance on four linguistic data sets used in semantic dependency parsing. We also explore a generalization of our parsing framework to dependency graphs with pagenumber at most k and show that the resulting optimization problem is NP-hard for k \geq 2.</abstract>
    <identifier type="citekey">kuhlmann-jonsson-2015-parsing</identifier>
    <identifier type="doi">10.1162/tacl_a_00158</identifier>
    <location>
        <url>https://aclanthology.org/Q15-1040</url>
    </location>
    <part>
        <date>2015</date>
        <detail type="volume"><number>3</number></detail>
        <extent unit="page">
            <start>559</start>
            <end>570</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Parsing to Noncrossing Dependency Graphs
%A Kuhlmann, Marco
%A Jonsson, Peter
%J Transactions of the Association for Computational Linguistics
%D 2015
%V 3
%I MIT Press
%C Cambridge, MA
%F kuhlmann-jonsson-2015-parsing
%X We study the generalization of maximum spanning tree dependency parsing to maximum acyclic subgraphs. Because the underlying optimization problem is intractable even under an arc-factored model, we consider the restriction to noncrossing dependency graphs. Our main contribution is a cubic-time exact inference algorithm for this class. We extend this algorithm into a practical parser and evaluate its performance on four linguistic data sets used in semantic dependency parsing. We also explore a generalization of our parsing framework to dependency graphs with pagenumber at most k and show that the resulting optimization problem is NP-hard for k \geq 2.
%R 10.1162/tacl_a_00158
%U https://aclanthology.org/Q15-1040
%U https://doi.org/10.1162/tacl_a_00158
%P 559-570

Markdown (Informal)

[Parsing to Noncrossing Dependency Graphs](https://aclanthology.org/Q15-1040) (Kuhlmann & Jonsson, TACL 2015)

• Parsing to Noncrossing Dependency Graphs (Kuhlmann & Jonsson, TACL 2015)

ACL

• Marco Kuhlmann and Peter Jonsson. 2015. Parsing to Noncrossing Dependency Graphs. Transactions of the Association for Computational Linguistics, 3:559–570.