CoChat

Ranking Generated Summaries by Correctness: An Interesting but Challenging Application for Natural Language Inference

Open access
Falke, Tobias, Ribeiro, Leonardo F. R., Utama, Prasetya Ajie, Dagan, Ido, Gurevych, Iryna · 2019 · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics

The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.

Abstract

While recent progress on abstractive summarization has led to remarkably fluent summaries, factual errors in generated summaries still severely limit their use in practice.In this paper, we evaluate summaries produced by state-of-the-art models via crowdsourcing and show that such errors occur frequently, in particular with more abstractive models.We study whether textual entailment predictions can be used to detect such errors and if they can be reduced by reranking alternative predicted summaries.That leads to an interesting downstream application for entailment models.In our experiments, we find that outof-the-box entailment models trained on NLI datasets do not yet offer the desired performance for the downstream task and we therefore release our annotations as additional test data for future extrinsic evaluations of NLI.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/p19-1213

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 4

  1. [1]1. Samuel R. Bowman, Gabor Angeli, Christopher Potts, and Christopher D. Manning. 2015. A Large An- notated Corpus for Learning Natural Language In- ference. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Process- ing, pages 632-642, Lisbon, Portugal.
  2. [4]4. Yen-Chun Chen and Mohit Bansal. 2018. Fast Abstrac- tive Summarization with Reinforce-Selected Sen- tence Rewriting. In Proceedings of the 56th Annual Meeting of the Association for Computational Lin- guistics, pages 675-686, Melbourne, Australia.
  3. [10]10. Sebastian Gehrmann, Yuntian Deng, and Alexander Rush. 2018. Bottom-Up Abstractive Summariza- tion. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Process- ing, pages 4098-4109, Brussels, Belgium.
  4. [23]23. Matthew Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer. 2018. Deep Contextualized Word Rep- resentations. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 2227-2237, New Orleans, LA, USA.

Cited by

See all 318

Metadata

Authors
Falke, T., Ribeiro, L. F. R., Utama, P. A., Dagan, I., & Gurevych, I.
Affiliations
  • Amazon (United States) (US)
  • Technische Universität Darmstadt (DE)
  • Bar-Ilan University (IL)
Venue
Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics
Published
2019
Pages
2214-2220
ISSN
0736-587X (ISSN-L)
OpenAlex
W2951211142
Cited by
265
References
28
Citations by year
2026: 11 · 2025: 16 · 2024: 19 · 2023: 68 · 2022: 60 · 2021: 57 · 2020: 28 · 2019: 6
FWCI
14.45
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Proceedings of the conference - Association for Computational Linguistics. Meeting (publishedVersion, cc-by)
  • TUbilio (Technical University of Darmstadt) (acceptedVersion)
  • TUbilio (Technical University of Darmstadt) (submittedVersion)
Funders
  • Deutsche Forschungsgemeinschaft (GRK 1994, GRK 1994/1, DA 1600/1-1, GU 798/17-1)
  • Technische Universität Darmstadt
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Text Analysis Techniques
Keywords
abstractive summarization, factual errors, natural language inference, crowdsourced evaluation, external evaluation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.