Abstract
This paper describes a wide-coverage statistical parser that uses Combinatory Categorial Grammar (CCG) to derive dependency structures. The parser differs from most existing wide-coverage treebank parsers in capturing the long-range dependencies inherent in constructions such as coordination, extraction, raising and control, as well as the standard local predicate-argument dependencies. A set of dependency structures used for training and testing the parser is obtained from a treebank of CCG normal-form derivations, which have been derived (semi-) automatically from the Penn Treebank. The parser correctly recovers over 80% of labelled dependencies, and around 90% of unlabelled dependencies.
Original language | English (US) |
---|---|
Pages (from-to) | 327-334 |
Number of pages | 8 |
Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
Volume | 2002-July |
State | Published - 2002 |
Externally published | Yes |
Event | 40th Annual Meeting of the Association for Computational Linguistics, ACL 2002 - Philadelphia, United States Duration: Jul 7 2002 → Jul 12 2002 |
ASJC Scopus subject areas
- Computer Science Applications
- Linguistics and Language
- Language and Linguistics