Towards Example-Based NMT with Multi-Levenshtein Transformers
Retrieval-Augmented Machine Translation (RAMT) is attracting growing attention. This is because RAMT not only improves translation metrics, but is also assumed to implement some form of domain adaptation. In this contribution, we study another salient trait of RAMT, its ability to make translation decisions more transparent by allowing users to go back to examples that contributed to these decisions. For this, we propose a novel architecture aiming to increase this transparency. This model adapts a retrieval-augmented version of the Levenshtein Transformer and makes it amenable to simultaneously edit multiple fuzzy matches found in memory. We discuss how to perform training and inference in this model, based on multi-way alignment algorithms and imitation learning. Our experiments show that editing several examples positively impacts translation scores, notably increasing the number of target spans that are copied from existing instances.
Code (1)
Tasks
Domain AdaptationImitation LearningMachine TranslationNMTRetrievalTranslationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A New String Edit Distance and Applications
String edit distances have been used for decades in applications ranging from spelling correction and web search suggestions to DNA analysis. Most string edit distances are variations of the Levenshtein distance and cons…
DNA analysisSpelling CorrectionInterpreting Sequence-Levenshtein distance for determining error type and frequency between two embedded sequences of equal length
Levenshtein distance is a commonly used edit distance metric, typically applied in language processing, and to a lesser extent, in molecular biology analysis. Biological nucleic acid sequences are often embedded in longe…
A Comprehensive Approach to Misspelling Correction with BERT and Levenshtein Distance
Writing, as an omnipresent form of human communication, permeates nearly every aspect of contemporary life. Consequently, inaccuracies or errors in written communication can lead to profound consequences, ranging from fi…
Language ModelingLanguage ModellingOptimizing example selection for retrieval-augmented machine translation with translation memories
Retrieval-augmented machine translation leverages examples from a translation memory by retrieving similar instances. These examples are used to condition the predictions of a neural decoder. We aim to improve the upstre…
DecoderMachine TranslationRetrievalSentence+1Sequence Covering Similarity for Symbolic Sequence Comparison
This paper introduces the sequence covering similarity, that we formally define for evaluating the similarity between a symbolic sequence (string) and a set of symbolic sequences (strings). From this covering similarity …