Please use this identifier to cite or link to this item: http://10.1.7.192:80/jspui/handle/123456789/10602
Title: Extractive Text Summarization: A Graph based Sentence Scoring Approach
Authors: Shir, Bhargav L
Keywords: Computer 2019
Project Report
Computer Project Report
Project Report 2019
19MCE
19MCED
19MCED16
CE (DS)
DS 2019
Issue Date: 1-Jun-2021
Publisher: Institute of Technology
Series/Report no.: 19MCED16;
Abstract: Text Summarization is an emerging field in Natural Language Process (NLP) domain. It is very full for summarizing full-length document automatically. We have proposed the statistical model for the text summarization process. Because of features like easy-to- use, less complex, low computation resources requirement, we have chosen the extractive text summarization model over the abstractive model. We have also used a graph-based model to establish relations between sentences, and mathematical operations to establish a relation between words and sentences. We have used documents from the “WiKiHow” dataset to test our model. We have also demonstrated the effect of the sentence clustering method by including the graph clustering stage in the post-processing phase. We have used the GraphFrame module from the Apache Spark environment as it has the ability to parallel the execution of graph-based operations. To evaluate our model we have used Recall-oriented Understudying Gisting Evaluation (ROUGE) parameters. Based on the obtained results, it is clear that graph clustering is dependent on the type of documents provided in the dataset.
URI: http://10.1.7.192:80/jspui/handle/123456789/10602
Appears in Collections:Dissertation, CE (DS)

Files in This Item:
File Description SizeFormat 
19MCED16.pdf19MCED161.69 MBAdobe PDFThumbnail
View/Open


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