mlsanityData to 14 Oct 2026

Levenshtein Training for Word-level Quality Estimation

arXiv 2109.05611 ↗First posted 12 Sep 2021cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

We propose a novel scheme to use the Levenshtein Transformer to perform the task of word-level quality estimation. A Levenshtein Transformer is a natural fit for this task: trained to perform decoding in an iterative manner, a Levenshtein Transformer can learn to post-edit without explicit supervision. To further minimize the mismatch between the translation task and the word-level QE task, we propose a two-stage transfer learning procedure on both augmented data and human post-editing data. We also propose heuristics to construct reference labels that are compatible with subword-level finetuning and inference. Results on WMT 2020 QE shared task dataset show that our proposed method has superior data efficiency under the data-constrained setting and competitive performance under the unconstrained setting.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 9 of its 20 references that are in the map. First posted on arXiv 12 Sep 2021.

Builds on

9 of 20 references.

References · 9

  1. 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,935
  2. 2020COMET: A Neural Framework for MT Evaluationcited by 1,033
  3. 2020Beyond English-Centric Multilingual Machine Translationcited by 561
  4. 2019Levenshtein Transformercited by 199
  5. 2019Facebook FAIR's WMT19 News Translation Task Submissioncited by 179
  6. 2020Automatic Machine Translation Evaluation in Many Languages via Zero-Shot Paraphrasingcited by 115
  7. 2019OpenKiwi: An Open Source Framework for Quality Estimationcited by 49
  8. 2020Paraphrase Generation as Zero-Shot Multilingual Translation: Disentangling Semantic Similarity from Lexical and Syntactic Diversitycited by 35
  9. 2020TransQuest at WMT2020: Sentence-Level Direct Assessmentcited by 20

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 0; 2025: 1.

3 papers.