Knowledge systems and Prolog: a logical approach to expert systems and natural language processing
Knowledge systems and Prolog: a logical approach to expert systems and natural language processing
Design of LMT: a prolog-based machine translation system
Computational Linguistics
Design of a Prolog-Based Machine Translation System
Proceedings of the Third International Conference on Logic Programming
Slot Grammar: A System for Simpler Construction of Practical Natural Language Grammars
Proceedings of the International Symposium on Natural Language and Logic
Computational Linguistics
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Experience with an easily computed metric for ranking alternative parsess
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
A computational mechanism for pronominal reference
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A syntactic filter on pronominal anaphora for Slot Grammar
ACL '90 Proceedings of the 28th 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
An algorithm for pronominal anaphora resolution
Computational Linguistics
Multilingual Anaphora Resolution
Machine Translation
The LMT Transformational System
AMTA '98 Proceedings of the Third Conference of the Association for Machine Translation in the Americas on Machine Translation and the Information Soup
An empirical approach to VP ellipsis
Computational Linguistics
EasyEnglish: a tool for improving document quality
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
A unification-based approach to multiple VP ellipsis resolution
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A discourse copying algorithm for ellipsis and anaphora resolution
EACL '93 Proceedings of the sixth conference on European chapter of the Association for 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
A theory of parallelism and the case of VP ellipsis
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the 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 effect of establishing coherence in ellipsis and anaphora resolution
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Subdeletion in verb phrase ellipsis
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Robust method of pronoun resolution using full-text information
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
VP ellipsis and contextual interpretation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A generalized reconstruction algorithm for ellipsis resolution
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Heuristics for broad-coverage natural language parsing
HLT '93 Proceedings of the workshop on Human Language Technology
Lappin and leass’ algorithm for pronoun resolution in portuguese
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
| Hi-index | 0.00 |
We present three algorithms for resolving anaphora in Slot Grammar: (1) an algorithm for interpreting elliptical VPs in antecedent-contained deletion structures, subdeletion constructions, and intersentential cases; (2) a syntactic filter on pronominal coreference; and (3) an algorithm for identifying the binder of an anaphor (reflexive pronoun or the reciprocal phrase "each other"). These algorithms operate on the output of a Slot Grammar parser, and, like the parser, they run in Prolog. The VP anaphora algorithm implements an S-structure analysis of VP ellipsis that we argue provides a more unified and empirically motivated treatment of VP anaphora resolution than analyses that attempt to interpret elliptical VPs at a level of logical form. Each algorithm can operate independently of the others, and we have incorporated each into an integrated anaphora resolution component. The interpreted elliptical VP structures that the VP anaphora algorithm produces provide the input to the two NP anaphora resolution procedures. The integrated anaphora resolution component provides a powerful syntactically driven module for generating partially interpreted representations that can serve as input to semantic and discourse interpretation systems.