Pith. sign in

REVIEW 1 cited by

Factual Error Correction for Abstractive Summarization Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.08712 v2 pith:VCDCUNLX submitted 2020-10-17 cs.CL cs.AI

classification cs.CLcs.AI
keywords factualsummarizationmodelssummariesabstractiveerrorgeneratedmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neural abstractive summarization systems have achieved promising progress, thanks to the availability of large-scale datasets and models pre-trained with self-supervised methods. However, ensuring the factual consistency of the generated summaries for abstractive summarization systems is a challenge. We propose a post-editing corrector module to address this issue by identifying and correcting factual errors in generated summaries. The neural corrector model is pre-trained on artificial examples that are created by applying a series of heuristic transformations on reference summaries. These transformations are inspired by an error analysis of state-of-the-art summarization model outputs. Experimental results show that our model is able to correct factual errors in summaries generated by other neural summarization models and outperforms previous models on factual consistency evaluation on the CNN/DailyMail dataset. We also find that transferring from artificial error correction to downstream settings is still very challenging.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Improving Next Tokens via Second-to-Last Predictions with Generate and Refine

    cs.CL 2024-11 conditional novelty 4.0 of 10

    A decoder-only model trained to predict the second-to-last token can slightly improve next-token predictions when used to re-rank a GPT's top-k candidates.

Pith tools