Abstract
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principle- and-parameters language framework. First, by investigating the combinatorics of free indexation, we show that the problem of enumerating all possible indexings requires exponential time. Secondly, we exhibit a provably optimal free indexation algorithm.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 105-110 |
| Number of pages | 6 |
| Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| Volume | 1990-June |
| State | Published - 1990 |
| Externally published | Yes |
| Event | 28th Annual Meeting of the Association for Computational Linguistics, ACL 1990 - Pittsburgh, United States Duration: Jun 6 1990 → Jun 9 1990 |
ASJC Scopus subject areas
- Computer Science Applications
- Linguistics and Language
- Language and Linguistics