Readings in natural language processing
An algorithm for pronominal anaphora resolution
Computational Linguistics
Centering: a framework for modeling the local coherence of discourse
Computational Linguistics
A machine learning approach to coreference resolution of noun phrases
Computational Linguistics - Special issue on computational anaphora resolution
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Robust pronoun resolution with limited knowledge
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
A model-theoretic coreference scoring scheme
MUC6 '95 Proceedings of the 6th conference on Message understanding
Machine Learning
Improving pronoun resolution using statistics-based semantic compatibility information
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Bootstrapping path-based pronoun resolution
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Multi-lingual coreference resolution with syntactic features
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Exploiting semantic role labeling, WordNet and Wikipedia for coreference resolution
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Competitive self-trained pronoun interpretation
HLT-NAACL-Short '04 Proceedings of HLT-NAACL 2004: Short Papers
Shallow semantics for coreference resolution
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hi-index | 0.00 |
Pronoun resolution refers to the problem of determining the coreference linkages between the antecedents and the pronouns. We propose to employ a combined model of statistical learning and first-order logic, the Markov logic network (MLN). Our proposed model can more effectively characterize the pronoun coreference resolution process that requires conducting inference upon a variety of conditions. The influence of different types of constraints are also investigated.