Dense Event Ordering with a Multi-Pass Architecture

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 par-tial 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 con-tain ∼10 times more relations per document than the TimeBank. We also describe a shift away from the single learner to a sieve-based ar-chitecture that naturally blends multiple learn-ers 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 de-scribes 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.