Automatic Text Summarization by Providing Coverage, Non-Redundancy, and Novelty Using Sentence Graph

Automatic Text Summarization by Providing Coverage, Non-Redundancy, and Novelty Using Sentence Graph

Krishnaveni P., Balasundaram S. R.
Copyright: © 2022 |Volume: 15 |Issue: 1 |Pages: 18
ISSN: 1938-7857|EISSN: 1938-7865|EISBN13: 9781683180340|DOI: 10.4018/JITR.2022010108
Cite Article Cite Article

MLA

Krishnaveni P., and Balasundaram S. R. "Automatic Text Summarization by Providing Coverage, Non-Redundancy, and Novelty Using Sentence Graph." JITR vol.15, no.1 2022: pp.1-18. http://doi.org/10.4018/JITR.2022010108

APA

Krishnaveni P. & Balasundaram S. R. (2022). Automatic Text Summarization by Providing Coverage, Non-Redundancy, and Novelty Using Sentence Graph. Journal of Information Technology Research (JITR), 15(1), 1-18. http://doi.org/10.4018/JITR.2022010108

Chicago

Krishnaveni P., and Balasundaram S. R. "Automatic Text Summarization by Providing Coverage, Non-Redundancy, and Novelty Using Sentence Graph," Journal of Information Technology Research (JITR) 15, no.1: 1-18. http://doi.org/10.4018/JITR.2022010108

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The day-to-day growth of online information necessitates intensive research in automatic text summarization (ATS). The ATS software produces summary text by extracting important information from the original text. With the help of summaries, users can easily read and understand the documents of interest. Most of the approaches for ATS used only local properties of text. Moreover, the numerous properties make the sentence selection difficult and complicated. So this article uses a graph based summarization to utilize structural and global properties of text. It introduces maximal clique based sentence selection (MCBSS) algorithm to select important and non-redundant sentences that cover all concepts of the input text for summary. The MCBSS algorithm finds novel information using maximal cliques (MCs). The experimental results of recall oriented understudy for gisting evaluation (ROUGE) on Timeline dataset show that the proposed work outperforms the existing graph algorithms Bushy Path (BP), Aggregate Similarity (AS), and TextRank (TR).