C4.5: programs for machine learning
C4.5: programs for machine learning
WordNet: a lexical database for English
Communications of the ACM
Machine Learning
A machine learning approach to coreference resolution of noun phrases
Computational Linguistics - Special issue on computational anaphora resolution
Improving machine learning approaches to coreference resolution
ACL '02 Proceedings of the 40th 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
Unrestricted Coreference: Identifying Entities and Events in OntoNotes
ICSC '07 Proceedings of the International Conference on Semantic Computing
Using decision trees for conference resolution
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
The WEKA data mining software: an update
ACM SIGKDD Explorations Newsletter
RelaxCor: A global relaxation labeling approach to coreference resolution
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
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
ETL ensembles for chunking, NER and SRL
CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
Latent structure perceptron with feature induction for unrestricted coreference resolution
CoNLL '12 Joint Conference on EMNLP and CoNLL - Shared Task
A mixed deterministic model for coreference resolution
CoNLL '12 Joint Conference on EMNLP and CoNLL - Shared Task
| Hi-index | 0.00 |
In this paper, we describe a machine learning system based on rule and tree ensembles for unrestricted coreference resolution. We use Entropy Guided Transformation Learning (ETL) and Decision Trees as the base learners, and, respectively, ETL Committee and Random Forest as ensemble algorithms. Our system is evaluated on the closed track of the CoNLL 2011 shared task: Modeling Unrestricted Coreference in OntoNotes. A preliminary version of our system achieves the 6th best score out of 21 competitors in the CoNLL 2011 shared task. Here, we depict the system architecture and our experimental results and findings.