EventFull: Complete and Consistent Event Relation Annotation

Alon Eirew, Eviatar Nachshoni, Aviv Slobodkin, Ido Dagan
12/17/2024
cs.CL

No official code found. Best implementation: AlonEirew/EventFull (7 stars, MIT, last commit 2025-03-31).

Abstract

Event relation detection is a fundamental NLP task, leveraged in many downstream applications, whose modeling requires datasets annotated with event relations of various types. However, systematic and complete annotation of these relations is costly and challenging, due to the quadratic number of event pairs that need to be considered. Consequently, many current event relation datasets lack systematicity and completeness. In response, we introduce \textit{EventFull}, the first tool that supports consistent, complete and efficient annotation of temporal, causal and coreference relations via a unified and synergetic process. A pilot study demonstrates that EventFull accelerates and simplifies the annotation process while yielding high inter-annotator agreement.

View on arXivView PDF

Code Implementations(1)

AlonEirew/EventFullCommunity100%
MIT

EventFull is an annotation tool designed for complete, high-quality annotation of temporal, coreference, and causal event relations within a single unified workflow.

71CSS, HTMLJun 17, 20241 years agoMIT

Similar Papers

Cite this paper

@article{eirew2024eventfull,
  title  = {EventFull: Complete and Consistent Event Relation Annotation},
  author = {Alon Eirew and Eviatar Nachshoni and Aviv Slobodkin and Ido Dagan},
  year   = {2024},
  eprint = {2412.12733},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.12733v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.12733.svg)](https://codeofpaper.com/paper/2412.12733)

Discussion