We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Artificial Intelligence & Machine Learning/An Annotation Framework for Dense Event Ordering
Conference ProceedingsArtificial Intelligence & Machine Learning

An Annotation Framework for Dense Event Ordering

Checking your access to this record.

Abstract & Overview

Today's event ordering research is heavily dependent on annotated corpora.Current corpora influence shared evaluations and drive algorithm development.Partly due to this dependence, most research focuses on partial orderings of a document's events.For instance, the TempEval competitions and the TimeBank only annotate small portions of the event graph, focusing on the most salient events or on specific types of event pairs (e.g., only events in the same sentence).Deeper temporal reasoners struggle with this sparsity because the entire temporal picture is not represented.This paper proposes a new annotation process with a mechanism to force annotators to label connected graphs.It generates 10 times more relations per document than the TimeBank, and our TimeBank-Dense corpus is larger than all current corpora.We hope this process and its dense corpus encourages research on new global models with deeper reasoning.

Cite this record

Taylor Cassidy, Bill McDowell, Nathanael Chambers, Steven J. Bethard (2014). An Annotation Framework for Dense Event Ordering. Annual Meeting of the Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/p14-2082

Copy in another style

Cassidy, T., McDowell, B., Chambers, N., & Bethard, S. J. (2014). An Annotation Framework for Dense Event Ordering. Annual Meeting of the Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/p14-2082
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.