Lexically constrained neural machine translation with levenshtein transformer

53Citations
Citations of this article
160Readers
Mendeley users who have this article in their library.

Abstract

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 run-time with custom dictionaries. Experiments on English-German WMT datasets show that our approach improves an unconstrained baseline and previous approaches.

Cite

CITATION STYLE

APA

Susanto, R. H., Chollampatt, S., & Tan, L. (2020). Lexically constrained neural machine translation with levenshtein transformer. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 3536–3543). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2020.acl-main.325

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free