A machine learning approach to coreference resolution of noun phrases
Computational Linguistics - Special issue on computational anaphora resolution
Identifying anaphoric and non-anaphoric noun phrases to improve coreference resolution
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
A model-theoretic coreference scoring scheme
MUC6 '95 Proceedings of the 6th conference on Message understanding
Improving machine learning approaches to coreference resolution
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Feature-rich part-of-speech tagging with a cyclic dependency network
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
A mention-synchronous coreference resolution algorithm based on the Bell tree
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Machine learning for coreference resolution: from local classification to global ranking
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Incorporating non-local information into information extraction systems by Gibbs sampling
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Bounding and comparing methods for correlation clustering beyond ILP
ILP '09 Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing
Graph-cut-based anaphoricity determination for coreference resolution
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Simple coreference resolution with rich syntactic and semantic features
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
Global learning of focused entailment graphs
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Supervised noun phrase coreference research: the first fifteen years
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Coreference resolution across corpora: languages, coding schemes, and preprocessing information
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Corry: A system for coreference resolution
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
A multi-pass sieve for coreference resolution
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
A global relaxation labeling approach to coreference resolution
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Global learning of typed entailment rules
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Bootstrapping coreference resolution using word associations
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Narrowing the modeling gap: a cluster-ranking approach to coreference resolution
Journal of Artificial Intelligence Research
Learning entailment relations by global graph structure optimization
Computational Linguistics
Coreference resolution with loose transitivity constraints
CONLL Shared Task '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning: Shared Task
Blanc: Implementing the rand index for coreference evaluation
Natural Language Engineering
Efficient tree-based approximation for entailment graph learning
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Joint learning for coreference resolution with Markov logic
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Coreference resolution: an empirical study based on SemEval-2010 shared Task 1
Language Resources and Evaluation
A constraint-based hypergraph partitioning approach to coreference resolution
Computational Linguistics
Deterministic coreference resolution based on entity-centric, precision-ranked rules
Computational Linguistics
Hi-index | 0.00 |
A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being coreferent with each of two other mentions, it will also consider the likelihood of those two mentions being coreferent when making a final assignment. This is exactly the kind of constraint that integer linear programming (ILP) is ideal for, but, surprisingly, previous work applying ILP to coreference resolution has not encoded this type of constraint. We train a coreference classifier over pairs of mentions, and show how to encode this type of constraint on top of the probabilities output from our pairwise classifier to extract the most probable legal entity assignments. We present results on two commonly used datasets which show that enforcement of transitive closure consistently improves performance, including improvements of up to 3.6% using the b3 scorer, and up to 16.5% using cluster f-measure.