A multigraph model for coreference resolution

Authors:
Sebastian Martschat;Jie Cai;Samuel Broscheit;Éva Mújdricza-Maydt;Michael Strube
Affiliations:
Heidelberg Institute for Theoretical Studies gGmbH, Heidelberg, Germany;Heidelberg Institute for Theoretical Studies gGmbH, Heidelberg, Germany;Heidelberg Institute for Theoretical Studies gGmbH, Heidelberg, Germany;Heidelberg Institute for Theoretical Studies gGmbH, Heidelberg, Germany;Heidelberg Institute for Theoretical Studies gGmbH, Heidelberg, Germany
Venue:
CoNLL '12 Joint Conference on EMNLP and CoNLL - Shared Task
Year:
2012

Citing 6
Cited 0

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
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
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
Stanford's multi-pass sieve coreference resolution system at the CoNLL-2011 shared task

CONLL Shared Task '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning: Shared Task
Unrestricted coreference resolution via global hypergraph partitioning

CONLL Shared Task '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning: Shared Task
CoNLL-2012 shared task: Modeling Multilingual Unrestricted Coreference in OntoNotes

CoNLL '12 Joint Conference on EMNLP and CoNLL - Shared Task

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents HITS' coreference resolution system that participated in the CoNLL-2012 shared task on multilingual unrestricted coreference resolution. Our system employs a simple multigraph representation of the relation between mentions in a document, where the nodes correspond to mentions and the edges correspond to relations between the mentions. Entities are obtained via greedy clustering. We participated in the closed tasks for English and Chinese. Our system ranked second in the English closed task.