Natural language, computational complexity, and generative capacity
Computers and Artificial Intelligence
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Toward A Principle-Based Parser
Toward A Principle-Based Parser
Principle-Based Parsing
A computational mechanism for pronominal reference
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Free indexation: combinatorial analysis and a compositional algorithm
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
A computational approach to Binding Theory
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A binding rule for Government-binding parsing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
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 work is concerned with the development of instruments for GB parsing. An alternative to the well known indexation system of (Chomsky, 1981) will be proposed and then used to formalize the view of Binding Theory in terms of the generation of constraints on the referential properties of the NPs of a sentence. Finally the problems of verification and satisfiability of BT will be addressed within the proposed framework.