An algorithm for pronominal anaphora resolution
Computational Linguistics
An architecture for anaphora resolution
ANLC '88 Proceedings of the second conference on Applied natural language processing
Principle based semantics for HPSG
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
ProFIT: prolog with features, inheritance and templates
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
Robust pronoun resolution with limited knowledge
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
The logical structure of binding
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
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
Anaphora resolution: a multi-strategy approach
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A binding rule for Government-binding parsing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
An algorithm for functional uncertainty
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
ANARESOLUTION '97 Proceedings of a Workshop on Operational Factors in Practical, Robust Anaphora Resolution for Unrestricted Texts
Anaphoric Constraints and Dualities in the Semantics of Nominals
Journal of Logic, Language and Information
Pronoun Resolution to Commanders and Recessors: A View from Event-Related Brain Potentials
DAARC '09 Proceedings of the 7th Discourse Anaphora and Anaphor Resolution Colloquium on Anaphora Processing and Applications
| Hi-index | 0.00 |
Binding constraints form one of the most robust modules of grammatical knowledge. Despite their crosslinguistic generality and practical relevance for anaphor resolution, they have resisted full integration into grammar processing. The ultimate reason for this is to be found in the original exhaustive coindexation rationale for their specification and verification. As an alternative, we propose an approach which, while permitting a unification-based specification of binding constraints, allows for a verification methodology that helps to overcome previous drawbacks. This alternative approach is based on the rationale that anaphoric nominals can be viewed as binding machines.