Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/70015
Title: Event-based summarization using critical temporal event term chain
Authors: Maofu, L
Li, W 
Xiaolong, Z
Ji, Z
Keywords: Event-Based summarization
Event term graph
Temporal event term chain
Depth-First search algorithm
Issue Date: 2009
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2009, v. 5459, p. 378-385 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: In this paper, we investigate whether temporal relations among event terms can help improve event-based summarization and text cohesion of final summaries. By connecting event terms with happens-before relations, we build a temporal event term graph for source documents. The event terms in the critical temporal event term chain identified from the maximal weakly connected component are used to evaluate the sentences in source documents. The most significant sentences are included in final summaries. Experiments conducted on the DUC 2001 corpus show that event-based summarization using the critical temporal event term chain is able to organize final summaries in a more coherent way and make improvement over the well-known tf*idf-based and PageRank-based summarization approaches.
Description: ICCPOL 2009 : 22nd International Conference on Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy, Hong Kong, March 26-27, 2009
URI: http://hdl.handle.net/10397/70015
ISBN: 978-3-642-00830-6
978-3-642-00831-3
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-642-00831-3_38
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

3
Checked on Nov 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.