Evaluating Temporal Graphs Built from Texts via Transitive Reduction
From MaRDI portal
Publication:3081456
DOI10.1613/JAIR.3118zbMATH Open1214.68454arXiv1401.3865OpenAlexW3106288757MaRDI QIDQ3081456
Author name not available (Why is that?)
Publication date: 8 March 2011
Published in: (Search for Journal in Brave)
Abstract: Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a text. This task raises the problem of comparing two annotations of a given text, because relations between events in a story are intrinsically interdependent and cannot be evaluated separately. A proper evaluation measure is also crucial in the context of a machine learning approach to the problem. Finding a common comparison referent at the text level is not obvious, and we argue here in favor of a shift from event-based measures to measures on a unique textual object, a minimal underlying temporal graph, or more formally the transitive reduction of the graph of relations between event boundaries. We support it by an investigation of its properties on synthetic data and on a well-know temporal corpus.
Full work available at URL: https://arxiv.org/abs/1401.3865
No records found.
This page was built for publication: Evaluating Temporal Graphs Built from Texts via Transitive Reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081456)