A machine learning approach to coreference resolution of noun phrases
Computational Linguistics - Special issue on computational anaphora resolution
Unrestricted Coreference: Identifying Entities and Events in OntoNotes
ICSC '07 Proceedings of the International Conference on Semantic Computing
BART: a modular toolkit for coreference resolution
HLT-Demonstrations '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Demo Session
Joint unsupervised coreference resolution with Markov logic
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
RelaxCor: A global relaxation labeling approach to coreference resolution
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
Poly-co: an unsupervised co-reference detection system
INLG '10 Proceedings of the 6th International Natural Language Generation Conference
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
| Hi-index | 0.00 |
This paper presents the coreference resolution system Poly-co submitted to the closed track of the CoNLL-2011 Shared Task. Our system integrates a multilayer perceptron classifier in a pipeline approach. We describe the heuristic used to select the pairs of coreference candidates that are feeded to the network for training, and our feature selection method. The features used in our approach are based on similarity and identity measures, filtering informations, like gender and number, and other syntactic information.