Inducing Event Schemas and Their Participants from Unlabeled Text
Author | : Nathanael William Chambers |
Publisher | : Stanford University |
Total Pages | : 159 |
Release | : 2011 |
ISBN-10 | : STANFORD:qk051hh1569 |
ISBN-13 | : |
Rating | : 4/5 (69 Downloads) |
Download or read book Inducing Event Schemas and Their Participants from Unlabeled Text written by Nathanael William Chambers and published by Stanford University. This book was released on 2011 with total page 159 pages. Available in PDF, EPUB and Kindle. Book excerpt: The majority of information on the Internet is expressed in written text. Understanding and extracting this information is crucial to building intelligent systems that can organize this knowledge, but most algorithms focus on learning atomic facts and relations. For instance, we can reliably extract facts like "Stanford is a University" and "Professors teach Science" by observing redundant word patterns across a corpus. However, these facts do not capture richer knowledge like the way detonating a bomb is related to destroying a building, or that the perpetrator who was convicted must have been arrested. A structured model of these events and entities is needed to understand language across many genres, including news, blogs, and even social media. This dissertation describes a new approach to knowledge acquisition and extraction that learns rich structures of events (e.g., plant, detonate, destroy) and participants (e.g., suspect, target, victim) over a large corpus of news articles, beginning from scratch and without human involvement. As opposed to early event models in Natural Language Processing (NLP) such as scripts and frames, modern statistical approaches and advances in NLP now enable new representations and large-scale learning over many domains. This dissertation begins by describing a new model of events and entities called Narrative Event Schemas. A Narrative Event Schema is a collection of events that occur together in the real world, linked by the typical entities involved. I describe the representation itself, followed by a statistical learning algorithm that observes chains of entities repeatedly connecting the same sets of events within documents. The learning process extracts thousands of verbs within schemas from 14 years of newspaper data. I present novel contributions in the field of temporal ordering to build classifiers that order the events and infer likely schema orderings. I then present several new evaluations for the extracted knowledge. Finally, I apply Narrative Event Schemas to the field of Information Extraction, learning templates of events with sets of semantic roles. Most Information Extraction approaches assume foreknowledge of the domain's templates, but I instead start from scratch and learn schemas as templates, and then extract the entities from text as in a standard extraction task. My algorithm is the first to learn templates without human guidance, and its results approach those of supervised algorithms.