Bottom-Up Abstractive Summarization

Sebastian Gehrmann, Yuntian Deng, Alexander M. Rush
8/31/2018
cs.CLcs.AIcs.LG

Official code: sebastianGehrmann/bottom-up-summary (178 stars, BSD-3-Clause, last commit 2019-01-31).

Abstract

Neural network-based methods for abstractive summarization produce outputs that are more fluent than other techniques, but which can be poor at content selection. This work proposes a simple technique for addressing this issue: use a data-efficient content selector to over-determine phrases in a source document that should be part of the summary. We use this selector as a bottom-up attention step to constrain the model to likely phrases. We show that this approach improves the ability to compress text, while still generating fluent summaries. This two-step process is both simpler and higher performing than other end-to-end content selection models, leading to significant improvements on ROUGE for both the CNN-DM and NYT corpus. Furthermore, the content selector can be trained with as little as 1,000 sentences, making it easy to transfer a trained summarizer to a new domain.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause
17842PythonMar 30, 20187 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{gehrmann2018bottomup,
  title  = {Bottom-Up Abstractive Summarization},
  author = {Sebastian Gehrmann and Yuntian Deng and Alexander M. Rush},
  year   = {2018},
  eprint = {1808.10792},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1808.10792}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1808.10792.svg)](https://codeofpaper.com/paper/1808.10792)

Discussion