Skip to main content

Event Schema Induction Based on Relational Co-occurrence over Multiple Documents

  • Conference paper
Natural Language Processing and Chinese Computing (NLPCC 2014)

Abstract

Event schema which comprises a set of related events and participants is of great importance with the development of information extraction (IE) and inducing event schema is prerequisite for IE and natural language generation. Event schema and slots are usually designed manually for traditional IE tasks. Methods for inducing event schemas automatically have been proposed recently. One of the fundamental assumptions in event schema induction is that related events tend to appear together to describe a scenario in natural-language discourse, meanwhile previous work only focused on co-occurrence in one document. We find that semantically typed relational tuples co-occurrence over multiple documents is helpful to construct event schema. We exploit the relational tuples co-occurrence over multiple documents by locating the key tuple and counting relational tuples, and build a co-occurrence graph which takes account of co-occurrence information over multiple documents. Experiments show that co-occurrence information over multiple documents can help to combine similar elements of event schema as well as to alleviate incoherence problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
eBook
USD 39.99
Price excludes VAT (USA)
Softcover Book
USD 54.99
Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chambers, N., Jurafsky, D.: Unsupervisedlearning of narrative event chains. In: Proceedings of ACL 2008: HLT (2008)

    Google Scholar 

  2. Chambers, N., Jurafsky, D.: Unsupervisedlearning of narrative schemas and their participants. In: Proceedings of ACL (2009)

    Google Scholar 

  3. Chambers, N., Jurafsky, D.: Template-basedinformation extraction without the templates. In: Proceedings of ACL (2011)

    Google Scholar 

  4. Balasubramanian, N., Soderland, S., Mausam, Etzioni, O.: Generating Coherent Event Schemas at Scale. In: Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing (2013)

    Google Scholar 

  5. Balasubramanian, N., Soderland, S., Mausam, Etzioni, O.: Rel-grams: A Probabilistic Model of Relations in Text. In: Proc. of the Joint Workshop on Automatic Knowledge Base Construction & Web-scale Knowledge Extraction (AKBC-WEKEX) (2012)

    Google Scholar 

  6. Cheung, J., Poon, H., Vandervende, L.: Probabilistic frame induction. In: Proceedings of NAACL HLT (2013)

    Google Scholar 

  7. Barzilay, R.R.: Multi Event Extraction Guided by Global Constraints. In: Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, T., Sha, L., Sui, Z. (2014). Event Schema Induction Based on Relational Co-occurrence over Multiple Documents. In: Zong, C., Nie, JY., Zhao, D., Feng, Y. (eds) Natural Language Processing and Chinese Computing. NLPCC 2014. Communications in Computer and Information Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45924-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45924-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45923-2

  • Online ISBN: 978-3-662-45924-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics