Type-inheritance combinatory categorial grammar

Authors:
John Beavers
Affiliations:
Stanford University, Stanford, CA
Venue:
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Year:
2004

Citing 7
Cited 1

The syntactic process

The syntactic process
Polynomial time parsing of Combinatory Categorial Grammars

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Efficient normal-form parsing for combinatory categorial grammar

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Categorial unification grammars

COLING '86 Proceedings of the 11th coference on Computational linguistics
The grammar matrix: an open-source starter-kit for the rapid development of cross-linguistically consistent broad-coverage precision grammars

COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Parsing the WSJ using CCG and log-linear models

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
The importance of supertagging for wide-coverage CCG parsing

COLING '04 Proceedings of the 20th international conference on Computational Linguistics

Parsing combinatory categorial grammar via planning in answer set programming

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper I outline Type-inheritance Combinatory Categorial Grammar (TCCG), an implemented feature structure based CCG fragment of English. TCCG combines the fully lexical nature of CCG with the type-inheritance hierarchies and complex feature structures of Headdriven Phrase Structure Grammars (HPSG). The result is a CCG/HPSG hybrid that combines linguistic generalizations previously only statable in one theory or the other, even extending the set of statable generalizations to those not easily captured by either theory.