<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="prolo-2000-efficient">
    <titleInfo>
        <title>An Efficient LR Parser Generator for Tree Adjoining Grammars</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Carlos</namePart>
        <namePart type="given">A</namePart>
        <namePart type="family">Prolo</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2000-feb&quot; 23-25&quot;</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Sixth International Workshop on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Trento, Italy</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>The first published LR algorithm for Tree Adjoining Grammars (TAGs [Joshi and Schabes, 1996]) was due to Schabes and Vijay-Shanker [1990] . Nederhof [1998] showed that it was incorrect (after [Kinyon, 1997]), and proposed a new one. Experimenting with his new algorithm over the XTAG English Grammar [XTAG Research Group, 1998] he concluded that LR parsing was inadequate for use with reasonably sized grammars because the size of the generated table was unmanageable. Also the degree of conflicts is too high. In this paper we discuss issues involved with LR parsing for TAGs and propose a new version of the algorithm that, by maintaining the degree of prediction while deferring the “subtree reduction”, dramatically reduces both the average number of conflicts per state and the size of the parser.</abstract>
    <identifier type="citekey">prolo-2000-efficient</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.21</url>
    </location>
    <part>
        <date>2000-feb&quot; 23-25&quot;</date>
        <extent unit="page">
            <start>207</start>
            <end>218</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T An Efficient LR Parser Generator for Tree Adjoining Grammars
%A Prolo, Carlos A.
%S Proceedings of the Sixth International Workshop on Parsing Technologies
%D 2000
%8 feb" 23 25"
%I Association for Computational Linguistics
%C Trento, Italy
%F prolo-2000-efficient
%X The first published LR algorithm for Tree Adjoining Grammars (TAGs [Joshi and Schabes, 1996]) was due to Schabes and Vijay-Shanker [1990] . Nederhof [1998] showed that it was incorrect (after [Kinyon, 1997]), and proposed a new one. Experimenting with his new algorithm over the XTAG English Grammar [XTAG Research Group, 1998] he concluded that LR parsing was inadequate for use with reasonably sized grammars because the size of the generated table was unmanageable. Also the degree of conflicts is too high. In this paper we discuss issues involved with LR parsing for TAGs and propose a new version of the algorithm that, by maintaining the degree of prediction while deferring the “subtree reduction”, dramatically reduces both the average number of conflicts per state and the size of the parser.
%U https://aclanthology.org/2000.iwpt-1.21
%P 207-218

Markdown (Informal)

[An Efficient LR Parser Generator for Tree Adjoining Grammars](https://aclanthology.org/2000.iwpt-1.21) (Prolo, IWPT 2000)

• An Efficient LR Parser Generator for Tree Adjoining Grammars (Prolo, IWPT 2000)

ACL

• Carlos A. Prolo. 2000. An Efficient LR Parser Generator for Tree Adjoining Grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 207–218, Trento, Italy. Association for Computational Linguistics.