Abstract
The model used by the CCG parser of Hockenmaier and Steedman (2002b) would fail to capture the correct bilexical dependencies in a language with freer word order, such as Dutch. This paper argues that probabilistic parsers should therefore model the dependencies in the predicate-argument structure, as in the model of Clark et al. (2002), and defines a generative model for CCG derivations that captures these dependencies, including bounded and unbounded long-range dependencies.
| Original language | English (US) |
|---|---|
| Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| Volume | 2003-July |
| State | Published - 2003 |
| Externally published | Yes |
| Event | 41st Annual Meeting of the Association for Computational Linguistics, ACL 2003 - Sapporo, Japan Duration: Jul 7 2003 → Jul 12 2003 |
ASJC Scopus subject areas
- Computer Science Applications
- Linguistics and Language
- Language and Linguistics