C4.5: programs for machine learning
C4.5: programs for machine learning
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
A machine learning approach to coreference resolution of noun phrases
Computational Linguistics - Special issue on computational anaphora resolution
A model-theoretic coreference scoring scheme
MUC6 '95 Proceedings of the 6th conference on Message understanding
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
On coreference resolution performance metrics
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
SemEval-2010 task 1: Coreference resolution in multiple languages
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
RelaxCor: A global relaxation labeling approach to coreference resolution
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
Evaluation metrics for end-to-end coreference resolution systems
SIGDIAL '10 Proceedings of the 11th Annual Meeting of the Special Interest Group on Discourse and Dialogue
A global relaxation labeling approach to coreference resolution
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
CoNLL-2011 shared task: modeling unrestricted coreference in OntoNotes
CONLL Shared Task '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning: Shared Task
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
A mixed deterministic model for coreference resolution
CoNLL '12 Joint Conference on EMNLP and CoNLL - Shared Task
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 |
This paper describes the participation of RelaxCor in the CoNLL-2011 shared task: "Modeling Unrestricted Coreference in Ontonotes". RELAXCOR is a constraint-based graph partitioning approach to coreference resolution solved by relaxation labeling. The approach combines the strengths of groupwise classifiers and chain formation methods in one global method.