USB: A Unified Summarization Benchmark Across Tasks and Domains

Kundan Krishna, Prakhar Gupta, Sanjana Ramprasad, Byron C. Wallace, Jeffrey P. Bigham +1 more
5/23/2023
cs.CLcs.LG

No official code found. Best implementation: kukrishna/usb (9 stars, Apache-2.0, last commit 2023-12-10).

Abstract

While the NLP community has produced numerous summarization benchmarks, none provide the rich annotations required to simultaneously address many important problems related to control and reliability. We introduce a Wikipedia-derived benchmark, complemented by a rich set of crowd-sourced annotations, that supports $8$ interrelated tasks: (i) extractive summarization; (ii) abstractive summarization; (iii) topic-based summarization; (iv) compressing selected sentences into a one-line summary; (v) surfacing evidence for a summary sentence; (vi) predicting the factual accuracy of a summary sentence; (vii) identifying unsubstantiated spans in a summary sentence; (viii) correcting factual errors in summaries. We compare various methods on this benchmark and discover that on multiple tasks, moderately-sized fine-tuned models consistently outperform much larger few-shot prompted language models. For factuality-related tasks, we also evaluate existing heuristics to create training data and find that training on them results in worse performance than training on $20\times$ less human-labeled data. Our articles draw from $6$ domains, facilitating cross-domain analysis. On some tasks, the amount of training data matters more than the domain where it comes from, while for other tasks training specifically on data from the target domain, even if limited, is more beneficial.

View on arXivView PDF

Code Implementations(1)

kukrishna/usbCommunity100%
Apache-2.0
91Shell, PythonMay 23, 20232 years agoApache-2.0

Similar Papers

Cite this paper

@article{krishna2023usb,
  title  = {USB: A Unified Summarization Benchmark Across Tasks and Domains},
  author = {Kundan Krishna and Prakhar Gupta and Sanjana Ramprasad and Byron C. Wallace and Jeffrey P. Bigham and Zachary C. Lipton},
  year   = {2023},
  eprint = {2305.14296},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.14296v2}
}

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/2305.14296.svg)](https://codeofpaper.com/paper/2305.14296)

Discussion