@inproceedings{komagata-1997-efficient,
title = "Efficient Parsing for {CCG}s with Generalized Type-raised Categories",
author = "Komagata, Nobo",
booktitle = "Proceedings of the Fifth International Workshop on Parsing Technologies",
month = sep # " 17-20",
year = "1997",
address = "Boston/Cambridge, Massachusetts, USA",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/1997.iwpt-1.17",
pages = "135--146",
abstract = "A type of {`}non-traditional constituents{'} motivates an extended class of Combinatory Categorial Grammars, CCGs with Generalized Type-Raised Categories (CCG-GTRC) involving variables. Although the class of standard CCGs is known to be polynomially parsable, unrestricted use of variables can destroy this essential requirement for a practical parser. This paper argues for polynomial parsability of CCG-GTRC from practical and theoretical points of view. First, we show that an experimental parser runs polynomially in practice on a realistic fragment of Japanese by eliminating spurious ambiguity and excluding genuine ambiguities. Then, we present a worst-case polynomial recognition algorithm for CCG-GTRC by extending the polynomial algorithm for the standard CCGs.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="komagata-1997-efficient">
<titleInfo>
<title>Efficient Parsing for CCGs with Generalized Type-raised Categories</title>
</titleInfo>
<name type="personal">
<namePart type="given">Nobo</namePart>
<namePart type="family">Komagata</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>1997-sep" 17-20"</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Fifth International Workshop on Parsing Technologies</title>
</titleInfo>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Boston/Cambridge, Massachusetts, USA</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>A type of ‘non-traditional constituents’ motivates an extended class of Combinatory Categorial Grammars, CCGs with Generalized Type-Raised Categories (CCG-GTRC) involving variables. Although the class of standard CCGs is known to be polynomially parsable, unrestricted use of variables can destroy this essential requirement for a practical parser. This paper argues for polynomial parsability of CCG-GTRC from practical and theoretical points of view. First, we show that an experimental parser runs polynomially in practice on a realistic fragment of Japanese by eliminating spurious ambiguity and excluding genuine ambiguities. Then, we present a worst-case polynomial recognition algorithm for CCG-GTRC by extending the polynomial algorithm for the standard CCGs.</abstract>
<identifier type="citekey">komagata-1997-efficient</identifier>
<location>
<url>https://aclanthology.org/1997.iwpt-1.17</url>
</location>
<part>
<date>1997-sep" 17-20"</date>
<extent unit="page">
<start>135</start>
<end>146</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Efficient Parsing for CCGs with Generalized Type-raised Categories
%A Komagata, Nobo
%S Proceedings of the Fifth International Workshop on Parsing Technologies
%D 1997
%8 sep" 17 20"
%I Association for Computational Linguistics
%C Boston/Cambridge, Massachusetts, USA
%F komagata-1997-efficient
%X A type of ‘non-traditional constituents’ motivates an extended class of Combinatory Categorial Grammars, CCGs with Generalized Type-Raised Categories (CCG-GTRC) involving variables. Although the class of standard CCGs is known to be polynomially parsable, unrestricted use of variables can destroy this essential requirement for a practical parser. This paper argues for polynomial parsability of CCG-GTRC from practical and theoretical points of view. First, we show that an experimental parser runs polynomially in practice on a realistic fragment of Japanese by eliminating spurious ambiguity and excluding genuine ambiguities. Then, we present a worst-case polynomial recognition algorithm for CCG-GTRC by extending the polynomial algorithm for the standard CCGs.
%U https://aclanthology.org/1997.iwpt-1.17
%P 135-146
Markdown (Informal)
[Efficient Parsing for CCGs with Generalized Type-raised Categories](https://aclanthology.org/1997.iwpt-1.17) (Komagata, IWPT 1997)
ACL