CLApr 27, 2020

Lexically Constrained Neural Machine Translation with Levenshtein Transformer

arXiv:2004.12681v11020 citations
Originality Incremental advance
AI Analysis

This work addresses the need for efficient and flexible terminology control in machine translation, though it is incremental as it builds on an existing Levenshtein Transformer model.

The paper tackles the problem of incorporating lexical constraints in neural machine translation by proposing a method that injects terminology at inference time without affecting decoding speed, and experiments on English-German WMT datasets show improvements over unconstrained baselines and previous approaches.

This paper proposes a simple and effective algorithm for incorporating lexical constraints in neural machine translation. Previous work either required re-training existing models with the lexical constraints or incorporating them during beam search decoding with significantly higher computational overheads. Leveraging the flexibility and speed of a recently proposed Levenshtein Transformer model (Gu et al., 2019), our method injects terminology constraints at inference time without any impact on decoding speed. Our method does not require any modification to the training procedure and can be easily applied at runtime with custom dictionaries. Experiments on English-German WMT datasets show that our approach improves an unconstrained baseline and previous approaches.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes