Please use this identifier to cite or link to this item:
http://drsr.daiict.ac.in//handle/123456789/788
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Majumder, Prasenjit | |
dc.contributor.author | Mehta, Parth | |
dc.date.accessioned | 2019-03-19T10:52:16Z | |
dc.date.available | 2019-03-19T10:52:16Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | Mehta, Parth (2018). From Extractive to Abstractive Summarization: A Journey. Dhirubhai Ambani Institute of Information and Communication Technology, x, 112 p. (Acc. No: T00751) | |
dc.identifier.uri | http://drsr.daiict.ac.in//handle/123456789/788 | |
dc.description.abstract | Research in the field of text summarisation has primarily been dominated by investigationsof various sentence extraction techniques with a significant focus towards news articles.In this thesis, we intend to look beyond generic sentence extraction and instead focuson domain-specific summarisation, methods for creating ensembles of multiple extractivesummarisation techniques and using sentence compression as the first step towardsabstractive summarisation.We start by proposing two new datasets for domain-specific summarisation. The firstcorpus is a collection of court judgements with corresponding handwritten summaries,while the second one is a collection of scientific articles from ACL anthology. The legalsummaries are recall-oriented and semi-extractive, compared to the abstracts of ACL articleswhich are more precision oriented and abstractive. Both collections have a reasonablenumber of article-summary pairs, enabling us to use data-driven techniques. Excludingnewswire corpora where the summaries are usually article headlines, the proposed collectionsare amongst the largest openly available collections of document summarisation.Next, we propose a completely data-driven technique for sentence extraction from legaland scientific articles. In both legal and ACL corpus, the summaries have a predefinedformat. Hence, it is possible to identify summary worthy sentences depending on whetherthey contain certain key phrases. Our proposed approach based on attention-based neuralnetwork learns to automatically identify these key phrases from pseudo-labelled data,without requiring any annotation or handcrafted rules. The proposed model outperformsexisting baselines and state of the art systems by a large margin.There are a large number of sentence extraction techniques, none of which guaranteebetter performance than the others. As a part of this thesis, we explore if it is possibleto leverage this variance in performance for generating an ensemble of several extractivetechniques. In the first model, we study the effect of using multiple sentence similarityscores, ranking algorithms and text representation techniques. We demonstrate that suchvariations can be used for improving Rank Aggregation. Using several sentence similaritymetrics, with any given ranking algorithm, always generates better abstracts. Next, wepropose several content-based aggregation models. Given the variation in performanceof extractive techniques across documents, the apriori knowledge about which techniquewould give the best result for a given document will drastically improve the result. Insuch case, an oracle ensemble system can be made which chose best possible summaryfor a given document. In the proposed content-based aggregation models, we estimatethe probability of a summary being good by looking at the amount of content it shareswith other candidate summaries. We present a hypothesis that a good summary will necessarilyshare more information with another good summary, but not with a bad summary.We build upon this argument to construct several content-based aggregation techniques,achieving a substantial improvement in the Rouge scores.In the end, we propose another attention based neural model for sentence compression.We use a novel context encoder, which helps the network to handle rare but informativeterms better. We compare the proposed approach to some sentence compression and abstractivetechniques that have been proposed in past few years. We present our argumentsfor and against these techniques and build a further roadmap for abstractive summarisation.In the end, we present the results on an end to end system which performs sentenceextraction using standalone summarisation systems as well as their ensembles and thenuses the sentence compression technique for generating the final abstractive summary. | |
dc.publisher | Dhirubhai Ambani Institute of Information and Communication Technology | |
dc.subject | Information Retreival System | |
dc.subject | Summarization | |
dc.subject | Information Fusion | |
dc.subject | Extractive Summarization | |
dc.subject | Corpora | |
dc.subject | LexRank | |
dc.subject | TextRank | |
dc.subject | Phrase Identification | |
dc.subject | Qualitative Analysis | |
dc.subject | Sentence Level Aggregation | |
dc.subject | Encoder | |
dc.subject | Abstractive Summarisation | |
dc.subject | Algorithms | |
dc.subject | Neural Model | |
dc.classification.ddc | 006.35 MEH | |
dc.title | From extractive to abstractive summarization: a journey | |
dc.type | Thesis | |
dc.degree | Ph.D | |
dc.student.id | 201321005 | |
dc.accession.number | T00751 | |
Appears in Collections: | PhD Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
201321005_Parth Mehta.pdf | 201321005 | 575.53 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.