<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="schiffer-maletti-2021-strong">
    <titleInfo>
        <title>Strong Equivalence of TAG and CCG</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Lena</namePart>
        <namePart type="given">Katharina</namePart>
        <namePart type="family">Schiffer</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Andreas</namePart>
        <namePart type="family">Maletti</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2021</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>Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the same class of string languages). It is demonstrated that their expressive power on trees also essentially coincides. In fact, CCG without lexicon entries for the empty string and only first-order rules of degree at most 2 are sufficient for its full expressive power.</abstract>
    <identifier type="citekey">schiffer-maletti-2021-strong</identifier>
    <identifier type="doi">10.1162/tacl_a_00393</identifier>
    <location>
        <url>https://aclanthology.org/2021.tacl-1.43</url>
    </location>
    <part>
        <date>2021</date>
        <detail type="volume"><number>9</number></detail>
        <extent unit="page">
            <start>707</start>
            <end>720</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Strong Equivalence of TAG and CCG
%A Schiffer, Lena Katharina
%A Maletti, Andreas
%J Transactions of the Association for Computational Linguistics
%D 2021
%V 9
%I MIT Press
%C Cambridge, MA
%F schiffer-maletti-2021-strong
%X Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the same class of string languages). It is demonstrated that their expressive power on trees also essentially coincides. In fact, CCG without lexicon entries for the empty string and only first-order rules of degree at most 2 are sufficient for its full expressive power.
%R 10.1162/tacl_a_00393
%U https://aclanthology.org/2021.tacl-1.43
%U https://doi.org/10.1162/tacl_a_00393
%P 707-720

Markdown (Informal)

[Strong Equivalence of TAG and CCG](https://aclanthology.org/2021.tacl-1.43) (Schiffer & Maletti, TACL 2021)

• Strong Equivalence of TAG and CCG (Schiffer & Maletti, TACL 2021)

ACL

• Lena Katharina Schiffer and Andreas Maletti. 2021. Strong Equivalence of TAG and CCG. Transactions of the Association for Computational Linguistics, 9:707–720.