EventFull: Complete and Consistent Event Relation Annotation
Alon Eirew, Eviatar Nachshoni, Aviv Slobodkin, Ido Dagan
TL;DR
EventFull tackles the problem of incomplete and inconsistent event relation annotation by enforcing complete coverage across temporal, causal, and coreference relations within a unified workflow. It guarantees output completeness via a layered process that combines transitive closure, consistency checks, and cross-type constraints, while remaining accessible to non-expert annotators. A pilot with three annotators on six documents shows high inter-annotator agreement and substantial reductions in manual effort, particularly for temporal and causal annotations, demonstrating the method's practicality. This approach enables the rapid creation of comprehensive, multi-relation event datasets across domains by integrating targeted intervention with automated reasoning.
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.
