The analysis of algorithms
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Modularity and information content classes in principle-based parsing
Computational Linguistics
Computational Linguistics
Indexing and referential dependencies within binding theory: a computational framework
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
The logical structure of binding
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Syntactic graphs and constraint satisfaction
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Binding constraints as instructions of binding machines
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
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.