<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="alonso-diaz-2003-parsing">
    <titleInfo>
        <title>Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Miguel</namePart>
        <namePart type="given">A</namePart>
        <namePart type="family">Alonso</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Víctor</namePart>
        <namePart type="given">J</namePart>
        <namePart type="family">Díaz</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2003-04</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Eighth International Conference on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <place>
                <placeTerm type="text">Nancy, France</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsing algorithm managing simultaneous adjunctions in TAG and TIG.</abstract>
    <identifier type="citekey">alonso-diaz-2003-parsing</identifier>
    <location>
        <url>https://aclanthology.org/W03-3001</url>
    </location>
    <part>
        <date>2003-04</date>
        <extent unit="page">
            <start>19</start>
            <end>30</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions
%A Alonso, Miguel A.
%A Díaz, Víctor J.
%S Proceedings of the Eighth International Conference on Parsing Technologies
%D 2003
%8 April
%C Nancy, France
%F alonso-diaz-2003-parsing
%X A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsing algorithm managing simultaneous adjunctions in TAG and TIG.
%U https://aclanthology.org/W03-3001
%P 19-30

Markdown (Informal)

[Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions](https://aclanthology.org/W03-3001) (Alonso & Díaz, IWPT 2003)

• Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions (Alonso & Díaz, IWPT 2003)

ACL

• Miguel A. Alonso and Víctor J. Díaz. 2003. Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions. In Proceedings of the Eighth International Conference on Parsing Technologies, pages 19–30, Nancy, France.