The grammatical basis of linguistic performance: language use and acquisition
The grammatical basis of linguistic performance: language use and acquisition
Natural language, computational complexity, and generative capacity
Computers and Artificial Intelligence
A computational mechanism for pronominal reference
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A binding rule for Government-binding parsing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
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
Binding constraints as instructions of binding machines
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular attention has been devoted to possible interactions of BT with other modules of the linguistic theory, such as those ruling argumental chains. Finally, the computational complexity of the algorithms has been studied.