The limits of automatic summarisation according to ROUGE

By Natalie Schluter. 2017

125 citations recorded by the source corpus.

This paper discusses some central caveats of summarisation, incurred in the use of the ROUGE metric for evaluation, with respect to optimal solutions. The task is NP-hard, of which we give the first proof. Still, as we show empirically for three central benchmark datasets for the task, greedy algorithms empirically seem to perform optimally according to the metric. Additionally, overall quality assurance is problematic: there is no natural upper bound on the quality of summarisation systems, and even humans are excluded from performing optimal summarisation.

Subfields: Artificial Intelligence, Natural Language Processing, Evaluation & Benchmarks

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yejin Choi
  2. Mohit Bansal
  3. Luke S. Zettlemoyer
  4. Percy Liang
  5. Noah A. Smith
  6. Jianfeng Gao
  7. Graham Neubig
  8. Hannaneh Hajishirzi

In Natural Language Processing

  1. Yejin Choi
  2. Mohit Bansal
  3. Samuel R. Bowman
  4. Mirella Lapata
  5. Noah A. Smith
  6. Luke S. Zettlemoyer
  7. Jianfeng Gao
  8. Caiming Xiong

In Evaluation & Benchmarks

  1. Yejin Choi
  2. Mohit Bansal
  3. Samuel R. Bowman
  4. Jason Phang
  5. Hinrich Schütze
  6. Ari Holtzman
  7. Andreas Vlachos
  8. Luke S. Zettlemoyer

Citations in the corpus