<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="satta-kuhlmann-2013-efficient">
    <titleInfo>
        <title>Efficient Parsing for Head-Split Dependency Trees</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Giorgio</namePart>
        <namePart type="family">Satta</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Marco</namePart>
        <namePart type="family">Kuhlmann</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2013</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>Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model. In this article we extend these techniques to a class of non-projective dependency trees, called well-nested dependency trees with block-degree at most 2, which has been previously investigated in the literature. We define a structural property that allows head splitting for these trees, and present two algorithms that improve over the runtime of existing algorithms at no significant loss in coverage.</abstract>
    <identifier type="citekey">satta-kuhlmann-2013-efficient</identifier>
    <identifier type="doi">10.1162/tacl_a_00226</identifier>
    <location>
        <url>https://aclanthology.org/Q13-1022</url>
    </location>
    <part>
        <date>2013</date>
        <detail type="volume"><number>1</number></detail>
        <extent unit="page">
            <start>267</start>
            <end>278</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Efficient Parsing for Head-Split Dependency Trees
%A Satta, Giorgio
%A Kuhlmann, Marco
%J Transactions of the Association for Computational Linguistics
%D 2013
%V 1
%I MIT Press
%C Cambridge, MA
%F satta-kuhlmann-2013-efficient
%X Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model. In this article we extend these techniques to a class of non-projective dependency trees, called well-nested dependency trees with block-degree at most 2, which has been previously investigated in the literature. We define a structural property that allows head splitting for these trees, and present two algorithms that improve over the runtime of existing algorithms at no significant loss in coverage.
%R 10.1162/tacl_a_00226
%U https://aclanthology.org/Q13-1022
%U https://doi.org/10.1162/tacl_a_00226
%P 267-278

Markdown (Informal)

[Efficient Parsing for Head-Split Dependency Trees](https://aclanthology.org/Q13-1022) (Satta & Kuhlmann, TACL 2013)

• Efficient Parsing for Head-Split Dependency Trees (Satta & Kuhlmann, TACL 2013)

ACL

• Giorgio Satta and Marco Kuhlmann. 2013. Efficient Parsing for Head-Split Dependency Trees. Transactions of the Association for Computational Linguistics, 1:267–278.