Back to results

Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science

Query-Focused Abstractive Summarization using Neural Networks

Abstract

dc:description.abstract

Query-focused abstractive document summarization (QFADS) is a process of shortening a document into a summary while keeping the context of query in mind. We implemented a model consisting of a novel selective mechanism for QFADS. A selective mechanism was used for improving the representation of a long input (passage) sequence. We conducted experiments on the Debatepedia dataset, a recently developed dataset for query-focused abstractive summarization task, which showed that our model outperforms the state-of-the-art model in all ROUGE scores. Also, we proposed three models all of which consist of a coarse-to-fine approach and a novel selective mechanism for query-focused abstractive multi document summarization (QFAMDS). The coarse-to-fine approach was used to reduce the length of the passage input from multiple documents. We conducted experiments on the MS MARCO dataset, a recently developed large scale dataset by Microsoft for reading comprehension, and have reported our scores using various evaluation metrics.

Degree

thesis:*
Grantor dc:publisher
Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science
Year dc:date.issued
2019

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Aryal, Chudamani
  • University of Lethbridge. Faculty of Arts and Science
Advisor dc:contributor.supervisor
  • Chali, Yllias

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Identifier
hdl:10133/5400

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-08-21
Source record
OAI-PMH GetRecord
citation

Aryal, Chudamani; University of Lethbridge. Faculty of Arts and Science. Query-Focused Abstractive Summarization using Neural Networks. Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, 2019. https://hdl.handle.net/10133/5400