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/Generating Coherent Event Schemas at Scale
Conference ProceedingsArtificial Intelligence & Machine Learning

Generating Coherent Event Schemas at Scale

Checking your access to this record.

Abstract & Overview

Chambers and Jurafsky (2009) demonstrated that event schemas can be automatically induced from text corpora.However, our analysis of their schemas identifies several weaknesses, e.g., some schemas lack a common topic and distinct roles are incorrectly mixed into a single actor.It is due in part to their pair-wise representation that treats subjectverb independently from verb-object.This often leads to subject-verb-object triples that are not meaningful in the real-world.We present a novel approach to inducing open-domain event schemas that overcomes these limitations.Our approach uses cooccurrence statistics of semantically typed relational triples, which we call Rel-grams (relational n-grams).In a human evaluation, our schemas outperform Chambers's schemas by wide margins on several evaluation criteria.Both Rel-grams and event schemas are freely available to the research community.

Cite this record

Niranjan Balasubramanian, Stephen Soderland, Mausam, Oren Etzioni (2013). Generating Coherent Event Schemas at Scale. Conference on Empirical Methods in Natural Language Processing (EMNLP). https://doi.org/10.18653/v1/d13-1178

Copy in another style

Balasubramanian, N., Soderland, S., Mausam, & Etzioni, O. (2013). Generating Coherent Event Schemas at Scale. Conference on Empirical Methods in Natural Language Processing (EMNLP). https://doi.org/10.18653/v1/d13-1178
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.