Design of LMT: a prolog-based machine translation system
Computational Linguistics
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 binding rule for Government-binding parsing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Anaphora resolution in slot grammar
Computational Linguistics
An algorithm for pronominal anaphora resolution
Computational Linguistics
EasyEnglish: a tool for improving document quality
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Corpus-based acquisition of relative pronoun disambiguation heuristics
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Heuristics for broad-coverage natural language parsing
HLT '93 Proceedings of the workshop on Human Language Technology
Learning to disambiguate relative pronouns
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
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 propose a syntactic filter for identifying non-coreferential pronoun-NP pairs within a sentence. The filter applies to the output of a Slot Grammar parser and is formulated in terms of the head-argument structures which the parser generates. It handles control and unbounded dependency constructions without empty categories or binding chains, by virtue of the unificational nature of the parser. The filter provides constraints for a discourse semantics system, reducing the search domain to which the inference rules of the system's anaphora resolution component apply.