mlsanityData to 7 Oct 2026

Improving Factual Error Correction by Learning to Inject Factual Errors

arXiv 2312.07049 ↗First posted 12 Dec 2023cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

Factual error correction (FEC) aims to revise factual errors in false claims with minimal editing, making them faithful to the provided evidence. This task is crucial for alleviating the hallucination problem encountered by large language models. Given the lack of paired data (i.e., false claims and their corresponding correct claims), existing methods typically adopt the mask-then-correct paradigm. This paradigm relies solely on unpaired false claims and correct claims, thus being referred to as distantly supervised methods. These methods require a masker to explicitly identify factual errors within false claims before revising with a corrector. However, the absence of paired data to train the masker makes accurately pinpointing factual errors within claims challenging. To mitigate this, we propose to improve FEC by Learning to Inject Factual Errors (LIFE), a three-step distantly supervised method: mask-corrupt-correct. Specifically, we first train a corruptor using the mask-then-corrupt procedure, allowing it to deliberately introduce factual errors into correct text. The corruptor is then applied to correct claims, generating a substantial amount of paired data. After that, we filter out low-quality data, and use the remaining data to train a corrector. Notably, our corrector does not require a masker, thus circumventing the bottleneck associated with explicit factual error identification. Our experiments on a public dataset verify the effectiveness of LIFE in two key aspects: Firstly, it outperforms the previous best-performing distantly supervised method by a notable margin of 10.59 points in SARI Final (19.3% improvement). Secondly, even compared to ChatGPT prompted with in-context examples, LIFE achieves a superiority of 7.16 points in SARI Final.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 22 of its 34 references that are in the map. First posted on arXiv 12 Dec 2023.

Builds on

22 of 34 references.

References · 22

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  6. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  7. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  8. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  9. 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,362
  10. 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
  11. 2020On Faithfulness and Factuality in Abstractive Summarizationcited by 895
  12. 2019TabFact: A Large-scale Dataset for Table-based Fact Verificationcited by 425
10 more
  1. 2017"Liar, Liar Pants on Fire": A New Benchmark Dataset for Fake News Detectioncited by 361
  2. 2020Autoregressive Entity Retrievalcited by 333
  3. 2016Enhanced LSTM for Natural Language Inferencecited by 199
  4. 2023AnnoLLM: Making Large Language Models to Be Better Crowdsourced Annotatorscited by 171
  5. 2021The Curious Case of Hallucinations in Neural Machine Translationcited by 161
  6. 2020Evidence-based Factual Error Correctioncited by 44
  7. 2019Automatic Fact-guided Sentence Modificationcited by 28
  8. 2020Fact-based Text Editingcited by 14
  9. 2021Show Me How To Revise: Improving Lexically Constrained Sentence Generation with XLNetcited by 10
  10. 2022Converge to the Truth: Factual Error Correction via Iterative Constrained Editingcited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 3.

4 papers.