2000 character limit reached
Learning Scripts as Hidden Markov Models (1809.03680v1)
Published 11 Sep 2018 in cs.CL
Abstract: Scripts have been proposed to model the stereotypical event sequences found in narratives. They can be applied to make a variety of inferences including filling gaps in the narratives and resolving ambiguous references. This paper proposes the first formal framework for scripts based on Hidden Markov Models (HMMs). Our framework supports robust inference and learning algorithms, which are lacking in previous clustering models. We develop an algorithm for structure and parameter learning based on Expectation Maximization and evaluate it on a number of natural datasets. The results show that our algorithm is superior to several informed baselines for predicting missing events in partial observation sequences.
- J. Walker Orr (5 papers)
- Prasad Tadepalli (33 papers)
- Janardhan Rao Doppa (62 papers)
- Xiaoli Fern (9 papers)
- Thomas G. Dietterich (28 papers)