Evaluating Temporal Graphs Built from Texts via Transitive Reduction release_gazlcmanmzgdxce5lulpnvyjau

by X. Tannier, P. Muller

Published in The Journal of Artificial Intelligence Research by AI Access Foundation.

2011   Volume 40, p375-413

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.
In application/xml+jats format

Archived Files and Locations

application/pdf  791.6 kB
file_uauqdfexuzcmvei67avglohaqu
web.archive.org (webarchive)
www.aaai.org (web)
application/pdf  558.7 kB
file_fbkotvohdnfhvfuo77wueniyc4
www.jair.org (web)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2011-02-22
Journal Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
Not in Keepers Registry
ISSN-L:  1076-9757
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: d11dccd7-f3b9-4cfa-bc6d-134abf616819
API URL: JSON