<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="kuhlmann-satta-2014-new">
    <titleInfo>
        <title>A New Parsing Algorithm for Combinatory Categorial Grammar</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">Giorgio</namePart>
        <namePart type="family">Satta</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2014</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 present a polynomial-time parsing algorithm for CCG, based on a new decomposition of derivations into small, shareable parts. Our algorithm has the same asymptotic complexity, O(n6), as a previous algorithm by Vijay-Shanker and Weir (1993), but is easier to understand, implement, and prove correct.</abstract>
    <identifier type="citekey">kuhlmann-satta-2014-new</identifier>
    <identifier type="doi">10.1162/tacl_a_00192</identifier>
    <location>
        <url>https://aclanthology.org/Q14-1032</url>
    </location>
    <part>
        <date>2014</date>
        <detail type="volume"><number>2</number></detail>
        <extent unit="page">
            <start>405</start>
            <end>418</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T A New Parsing Algorithm for Combinatory Categorial Grammar
%A Kuhlmann, Marco
%A Satta, Giorgio
%J Transactions of the Association for Computational Linguistics
%D 2014
%V 2
%I MIT Press
%C Cambridge, MA
%F kuhlmann-satta-2014-new
%X We present a polynomial-time parsing algorithm for CCG, based on a new decomposition of derivations into small, shareable parts. Our algorithm has the same asymptotic complexity, O(n6), as a previous algorithm by Vijay-Shanker and Weir (1993), but is easier to understand, implement, and prove correct.
%R 10.1162/tacl_a_00192
%U https://aclanthology.org/Q14-1032
%U https://doi.org/10.1162/tacl_a_00192
%P 405-418

Markdown (Informal)

[A New Parsing Algorithm for Combinatory Categorial Grammar](https://aclanthology.org/Q14-1032) (Kuhlmann & Satta, TACL 2014)

• A New Parsing Algorithm for Combinatory Categorial Grammar (Kuhlmann & Satta, TACL 2014)

ACL

• Marco Kuhlmann and Giorgio Satta. 2014. A New Parsing Algorithm for Combinatory Categorial Grammar. Transactions of the Association for Computational Linguistics, 2:405–418.