DocumentCode
2347583
Title
Optimal Features Set for Extractive Automatic Text Summarization
Author
Meena, Yogesh Kumar ; Deolia, Peeyush ; Gopalani, Dinesh
Author_Institution
Dept. of Comput. Sci. & Eng., Malaviya Nat. Inst. of Technol., Jaipur, India
fYear
2015
fDate
21-22 Feb. 2015
Firstpage
35
Lastpage
40
Abstract
The goal of text summarization is to reduce the size of the text while preserving its important information and overall meaning. With the availability of internet, data is growing leaps and bounds and it is practically impossible summarizing all this data manually. Automatic summarization can be classified as extractive and abstractive summarization. For abstractive summarization we need to understand the meaning of the text and then create a shorter version which best expresses the meaning, While in extractive summarization we select sentences from given data itself which contains maximum information and fuse those sentences to create an extractive summary. In this paper we tested all possible combinations of seven features and then reported the best one for particular document. We analyzed the results for all 10 documents taken from DUC 2002 dataset using ROUGE evaluation matrices.
Keywords
text analysis; DUC 2002 dataset; ROUGE evaluation matrices; abstractive summarization; extractive automatic text summarization; extractive summarization; optimal features set; Algorithm design and analysis; Computer science; Data mining; Feature extraction; Lead; Natural languages; Time-frequency analysis; Abstractive; Extractive; Feature; Term Frequency; Text Summarization;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computing & Communication Technologies (ACCT), 2015 Fifth International Conference on
Conference_Location
Haryana
Print_ISBN
978-1-4799-8487-9
Type
conf
DOI
10.1109/ACCT.2015.123
Filename
7079048
Link To Document