作者
Kaustubh Patil, Pavel Brazdil
发表日期
2007
期刊
International Journal on Computer Science and Information Systems
卷号
2
期号
1
页码范围
18-32
简介
We present a graph theoretic technique for automatic text summarization aimed at producing extractive summaries of a single document. In our system, called as SumGraph, text is represented as a graph with sentences as nodes while weights on the links represent intra-sentence dissimilarity. Novelty of our approach lies in the use of Pathfinder Network Scaling (PFnet) technique representing conceptual organization of the text which in turn is used to compute importance of a sentence in the text. Importance of a sentence is defined using its centrality in the PFnet. Use of Latent Semantic Analysis (LSA) is also investigated. PFnet and LSA have been shown to model human aspects of semantic memory and linguistic acquisition respectively. The system is empirically evaluated on DUC2001 and DUC2002 datasets using ROUGE measure. Results show that SumGraph performs better than other systems, including a commercial summarizer. Use of LSA did not show any improvement in ROUGE score. We also show that SumGraph is statistically different than other methods using a non-parametric statistical test.
引用总数
20082009201020112012201320142015201620172018201920202021202220232024122636588328311
学术搜索中的文章
K Patil, P Brazdil - International Journal on Computer Science and …, 2007