Elamur Research⌕
☰
home / papers / 2009 / Graph-based Event Coreference Resolution

Graph-based Event Coreference Resolution

Summary

Chen and Ji tackle event coreference resolution as defined by the ACE program: grouping event mentions in a document so that each group describes one real-world event. They argue the task is harder than entity coreference because coreferring event mentions are sentence-level and structurally diverse. They illustrate this with a news example about a cafe bombing. The authors represent the mentions of each event type as an undirected weighted graph and partition it with spectral clustering under the normalized-cut objective (Shi and Malik, 2000). Their contribution is not a new clustering algorithm but two ways to estimate the coreference (affinity) matrix:

  • a hand-designed formula based on corpus statistics of trigger and argument matches;
  • a maximum entropy classifier using lexical, distance and argument features.

On the ACE 2005 English corpus with gold event mentions, both methods reach ECM-F scores of about 0.83. Both clearly beat simple baselines. This shows that graph clustering is a workable framework for event coreference.

Key points

  • Data and evaluation: ACE 2005 English corpus (560 documents), split into 500 for training, development and statistics, and 60 for testing. Evaluation uses ground-truth event mentions and ECM F-Measure (Luo, 2005).
  • Graph setup: A separate graph is built for each event type, treating the 33 ACE subtypes as types.
  • Method 1 (formula): Scores trigger agreement at several levels: exact match, same stem, or positive WordNet similarity. It also scores argument agreement by whether entity ID and ROLE match. Corpus counts show that identical triggers and fully matching arguments are the strongest coreference cues.
  • Results: With 10-fold cross-validation, the best cut threshold is 0.85 for both methods. Method 1 scores 0.8449 and Method 2 scores 0.8418, a weak difference (p≤0.1447). On the test set, the methods score 0.8363 and 0.8312.
  • Baselines and future work: Putting all same-type mentions into one cluster gives ECM-F 0.535, and treating every mention as a singleton gives 0.7635. The impact of system-extracted, non-gold mentions is left for future work.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Linguistics & languages

Topics: Coreference resolution

Cited by

46 papers of our library cite it (of the 140673 whose bibliographies we read); 21 of them have a page here, 25 not yet.

Cite

The paper itself, not this page. BibTeX from the library's record of the work.

@inproceedings{chen2009graph,
  title = {{Graph-based Event Coreference Resolution}},
  author = {Chen, Zheng and Ji, Heng},
  booktitle = {Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing (TextGraphs-4)},
  year = {2009},
  doi = {10.3115/1708124.1708135},
  url = {https://doi.org/10.3115/1708124.1708135}
}

References

6 references, 4 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. A. Bagga and B. Baldwin. 1999. Cross-document event coreference: Annotations, experiments, and observations. In Proc. ACL-99 Workshop on Coreference and Its Applications. find our card
  2. C. Nicolae and G. Nicolae. 2006. Bestcut: A graph algorithm for coreference resolution. In EMNLP, pages 275–283, Sydney, Australia, July. find our card
  3. J. Shi and J. Malik.1997. Normalized Cuts and Image Segmentation. In Proc. of IEEE Conf. on Comp. find
  4. Vision and Pattern Recognition, Puerto Rico K. Humphreys, R. Gaizauskas, S. Azzam. 1997. Event coreference for information extraction. In Proceedings of the ACL Workshop on Operational Factors in Practical Robust Anaphora Resolution for Unrestricted Texts. find our card
  5. N. Seco, T. Veale, J. Hayes. 2004. An intrinsic information content metric for semantic similarity in WordNet. In Proc. of ECAI-04, pp. 1089–1090. find
  6. X. Luo. 2005. On coreference resolution performance metrics. Proc. of HLT-EMNLP. find our card

↑ back to top

This page in Markdown →