Global storage cells for attributes in an attribute grammar
Acta Informatica
Compiler Construction
Toward A Principle-Based Parser
Toward A Principle-Based Parser
Parsing a free-word order language: warlpiri
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
An attribute-grammar implementation of Government-binding theory
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A PROLOG implementation of Government-Binding Theory
COLING '86 Proceedings of the 11th coference on Computational linguistics
Anaphora resolution in slot grammar
Computational Linguistics
Computational Linguistics
ParseTalk about sentence- and text-level anaphora
EACL '95 Proceedings of the seventh conference on European chapter of the Association for 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
A syntactic filter on pronominal anaphora for Slot Grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Corpus-based acquisition of relative pronoun disambiguation heuristics
ACL '92 Proceedings of the 30th 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
A computational approach to Binding Theory
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Anaphor resolution and the scope of syntactic constraints
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Resolving anaphoric references on deficient syntactic descriptions
ANARESOLUTION '97 Proceedings of a Workshop on Operational Factors in Practical, Robust Anaphora Resolution for Unrestricted Texts
Learning to disambiguate relative pronouns
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
| Hi-index | 0.00 |
In this paper I propose a Binding rule for the identification of pronoun and anaphor referents in phrase-structure tress, assuming the general framework of the Government-binding theory outlined by Chomsky (1981). The Binding rule, specified by means of an attribute grammar, is a particular instantiation of the Free Indexing rule and binding axioms in Chomsky's Binding theory, with certain empirical and practical advantages. The complexities of the Binding rule proposed, as well as that inherent in Chomsky's Binding theory, are studied, and it is shown that the new rule is more psychologically plausible and computationally efficient than the original theory on which it is based. The fragment of the attribute grammar shown here is part of an English grammar and parser being developed in the Prolog and PLNLP languages.