<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="chen-vijay-shanker-2000-automated">
    <titleInfo>
        <title>Automated Extraction of TAGs from the Penn Treebank</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">John</namePart>
        <namePart type="family">Chen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">K</namePart>
        <namePart type="family">Vijay-Shanker</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 accuracy of statistical parsing models can be improved with the use of lexical information. Statistical parsing using Lexicalized tree adjoining grammar (LTAG), a kind of lexicalized grammar, has remained relatively unexplored. We believe that is largely in part due to the absence of large corpora accurately bracketed in terms of a perspicuous yet broad coverage LTAG. Our work attempts to alleviate this difficulty. We extract different LTAGs from the Penn Treebank. We show that certain strategies yield an improved extracted LTAG in terms of compactness, broad coverage, and supertagging accuracy. Furthermore, we perform a preliminary investigation in smoothing these grammars by means of an external linguistic resource, namely, the tree families of an XTAG grammar, a hand built grammar of English.</abstract>
    <identifier type="citekey">chen-vijay-shanker-2000-automated</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.9</url>
    </location>
    <part>
        <date>2000-feb&quot; 23-25&quot;</date>
        <extent unit="page">
            <start>65</start>
            <end>76</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Automated Extraction of TAGs from the Penn Treebank
%A Chen, John
%A Vijay-Shanker, K.
%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 chen-vijay-shanker-2000-automated
%X The accuracy of statistical parsing models can be improved with the use of lexical information. Statistical parsing using Lexicalized tree adjoining grammar (LTAG), a kind of lexicalized grammar, has remained relatively unexplored. We believe that is largely in part due to the absence of large corpora accurately bracketed in terms of a perspicuous yet broad coverage LTAG. Our work attempts to alleviate this difficulty. We extract different LTAGs from the Penn Treebank. We show that certain strategies yield an improved extracted LTAG in terms of compactness, broad coverage, and supertagging accuracy. Furthermore, we perform a preliminary investigation in smoothing these grammars by means of an external linguistic resource, namely, the tree families of an XTAG grammar, a hand built grammar of English.
%U https://aclanthology.org/2000.iwpt-1.9
%P 65-76

Markdown (Informal)

[Automated Extraction of TAGs from the Penn Treebank](https://aclanthology.org/2000.iwpt-1.9) (Chen & Vijay-Shanker, IWPT 2000)

• Automated Extraction of TAGs from the Penn Treebank (Chen & Vijay-Shanker, IWPT 2000)

ACL

• John Chen and K. Vijay-Shanker. 2000. Automated Extraction of TAGs from the Penn Treebank. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 65–76, Trento, Italy. Association for Computational Linguistics.