Dense Event Ordering with a Multi-Pass Architecture

By Nathanael Chambers, Taylor Cassidy, Bill McDowell, Steven Bethard. 2014

197 citations recorded by the source corpus.

The past 10 years of event ordering research has focused on learning partial orderings over document events and time expressions. The most popular corpus, the TimeBank, contains a small subset of the possible ordering graph. Many evaluations follow suit by only testing certain pairs of events (e.g., only main verbs of neighboring sentences). This has led most research to focus on specific learners for partial labelings. This paper attempts to nudge the discussion from identifying some relations to all relations. We present new experiments on strongly connected event graphs that contain ∼10 times more relations per document than the TimeBank. We also describe a shift away from the single learner to a sieve-based architecture that naturally blends multiple learners into a precision-ranked cascade of sieves. Each sieve adds labels to the event graph one at a time, and earlier sieves inform later ones through transitive closure. This paper thus describes innovations in both approach and task. We experiment on the densest event graphs to date and show a 14% gain over state-of-the-art.

Subfields: Artificial Intelligence, Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Nanyun Peng
  2. Xiang Ren
  3. Dan Roth
  4. Rujun Han
  5. Daniel Khashabi
  6. Greg Durrett
  7. Qiang Ning
  8. Hannaneh Hajishirzi

In Computer Networks and Communications

  1. Nanyun Peng
  2. Rujun Han
  3. Qiang Ning
  4. Aram Galstyan
  5. Dan Roth
  6. Daniel Khashabi
  7. Hao Wu
  8. Matt Gardner

Citations in the corpus