Abstract
In contrast to entity coreference resolution, event coreference resolution has not received great attention from researchers. In this paper, we first demonstrate the diverse scenarios of event coreference by an example. We then model event coreference resolution as a spectral graph clustering problem and evaluate the clustering algorithm on ground truth event mentions using ECM F-Measure. We obtain the ECM-F scores of 0.8363 and 0.8312 respectively by using two methods for computing coreference matrices.
Cite
CITATION STYLE
Chen, Z., & Ji, H. (2009). Graph-based event coreference resolution. In ACL-IJCNLP 2009 - TextGraphs 2009: 2009 Workshop on Graph-Based Methods for Natural Language Processing, Proceedings of the Workshop (pp. 54–57). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1708124.1708135
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
