Abstractive text summarization based on improved semantic graph approach

The goal of abstractive summarization of multi-documents is to automatically produce a condensed version of the document text and maintain the significant information. Most of the graph-based extractive methods represent sentence as bag of words and utilize content similarity measure, which might fa...

Full description

Saved in:
Bibliographic Details
Main Authors: Khan, Atif, Salim, Naomie, Farman, Haleem, Khan, Murad
Format: Article
Published: Springer New York LLC 2018
Subjects:
Online Access:http://eprints.utm.my/id/eprint/86716/
http://dx.doi.org/10.1007/s10766-018-0560-3
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
id my.utm.86716
record_format eprints
spelling my.utm.867162020-09-30T09:04:55Z http://eprints.utm.my/id/eprint/86716/ Abstractive text summarization based on improved semantic graph approach Khan, Atif Salim, Naomie Farman, Haleem Khan, Murad QA75 Electronic computers. Computer science The goal of abstractive summarization of multi-documents is to automatically produce a condensed version of the document text and maintain the significant information. Most of the graph-based extractive methods represent sentence as bag of words and utilize content similarity measure, which might fail to detect semantically equivalent redundant sentences. On other hand, graph based abstractive method depends on domain expert to build a semantic graph from manually created ontology, which requires time and effort. This work presents a semantic graph approach with improved ranking algorithm for abstractive summarization of multi-documents. The semantic graph is built from the source documents in a manner that the graph nodes denote the predicate argument structures (PASs)—the semantic structure of sentence, which is automatically identified by using semantic role labeling; while graph edges represent similarity weight, which is computed from PASs semantic similarity. In order to reflect the impact of both document and document set on PASs, the edge of semantic graph is further augmented with PAS-to-document and PAS-to-document set relationships. The important graph nodes (PASs) are ranked using the improved graph ranking algorithm. The redundant PASs are reduced by using maximal marginal relevance for re-ranking the PASs and finally summary sentences are generated from the top ranked PASs using language generation. Experiment of this research is accomplished using DUC-2002, a standard dataset for document summarization. Experimental findings signify that the proposed approach shows superior performance than other summarization approaches. Springer New York LLC 2018-10-01 Article PeerReviewed Khan, Atif and Salim, Naomie and Farman, Haleem and Khan, Murad (2018) Abstractive text summarization based on improved semantic graph approach. International Journal of Parallel Programming, 46 (5). pp. 992-1016. ISSN 0885-7458 http://dx.doi.org/10.1007/s10766-018-0560-3 DOI:10.1007/s10766-018-0560-3
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Khan, Atif
Salim, Naomie
Farman, Haleem
Khan, Murad
Abstractive text summarization based on improved semantic graph approach
description The goal of abstractive summarization of multi-documents is to automatically produce a condensed version of the document text and maintain the significant information. Most of the graph-based extractive methods represent sentence as bag of words and utilize content similarity measure, which might fail to detect semantically equivalent redundant sentences. On other hand, graph based abstractive method depends on domain expert to build a semantic graph from manually created ontology, which requires time and effort. This work presents a semantic graph approach with improved ranking algorithm for abstractive summarization of multi-documents. The semantic graph is built from the source documents in a manner that the graph nodes denote the predicate argument structures (PASs)—the semantic structure of sentence, which is automatically identified by using semantic role labeling; while graph edges represent similarity weight, which is computed from PASs semantic similarity. In order to reflect the impact of both document and document set on PASs, the edge of semantic graph is further augmented with PAS-to-document and PAS-to-document set relationships. The important graph nodes (PASs) are ranked using the improved graph ranking algorithm. The redundant PASs are reduced by using maximal marginal relevance for re-ranking the PASs and finally summary sentences are generated from the top ranked PASs using language generation. Experiment of this research is accomplished using DUC-2002, a standard dataset for document summarization. Experimental findings signify that the proposed approach shows superior performance than other summarization approaches.
format Article
author Khan, Atif
Salim, Naomie
Farman, Haleem
Khan, Murad
author_facet Khan, Atif
Salim, Naomie
Farman, Haleem
Khan, Murad
author_sort Khan, Atif
title Abstractive text summarization based on improved semantic graph approach
title_short Abstractive text summarization based on improved semantic graph approach
title_full Abstractive text summarization based on improved semantic graph approach
title_fullStr Abstractive text summarization based on improved semantic graph approach
title_full_unstemmed Abstractive text summarization based on improved semantic graph approach
title_sort abstractive text summarization based on improved semantic graph approach
publisher Springer New York LLC
publishDate 2018
url http://eprints.utm.my/id/eprint/86716/
http://dx.doi.org/10.1007/s10766-018-0560-3
_version_ 1680321085663346688