Extractive summarization based on event term temporal relation graph and critical chain

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we investigate whether temporal relations among event terms can help improve event-based extractive summarization and text cohesion of machine-generated summaries. Using the verb semantic relation, namely happens-before provided by VerbOcean, we construct an event term temporal relation graph for source documents. We assume that the maximal weakly connected component on this graph represents the main topic of source documents. The event terms in the temporal critical chain identified from the maximal weakly connected component are then used to calculate the significance of the sentences in source documents. The most significant sentences are included in final summaries. Experiments conducted on the DUC 2001 corpus show that extractive summarization based on event term temporal relation graph and critical chain is able to organize final summaries in a more coherent way and accordingly achieves encouraging improvement over the well-known tf*idf-based and PageRank-based approaches. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Liu, M., Li, W., & Hu, H. (2009). Extractive summarization based on event term temporal relation graph and critical chain. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5839 LNCS, pp. 87–99). https://doi.org/10.1007/978-3-642-04769-5_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free