Improved Lexically Constrained Decoding for Translation and Monolingual Rewriting (N19-1)
Copied to clipboard
J. Edward Hu, Huda Khayrallah, Ryan Culkin, Patrick Xia, Tongfei Chen, Matt Post, Benjamin Van Durme
| Challenge: | Lexically-constrained sequence decoding allows for explicit positive or negative phrase-based constraints to be placed on target output strings in machine translation or monolingual text rewriting tasks. |
| Approach: | They propose a vectorized dynamic beam allocation algorithm which extends work in lexically-constrained decoding to work with batching. |
| Outcome: | The proposed method improves on natural language inference, question answering and machine translation tasks by fivefold . |
Similar Papers
Fast Lexically Constrained Decoding with Dynamic Beam Allocation for Neural Machine Translation (N18-1)
Copied to clipboard
| Challenge: | Existing approaches to neural machine translation have computational complexities that are either linear or exponential in the number of constraints. |
| Approach: | They propose an algorithm for lexically constrained decoding with a complexity of O(1) in the number of constraints. |
| Outcome: | The proposed algorithm can place constraints and improve results in simulated post-editing tasks. |
Parallel Refinements for Lexically Constrained Text Generation with BART (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing work injects lexical constraints into the output, which generates generic or ungrammatical sentences and has high computational complexity. |
| Approach: | They propose a model that incorporates pre-specified keywords into the output to control the generated text. |
| Outcome: | The proposed model decomposes the generated text into two sub-tasks and improves the sentence quality. |
Edit-Constrained Decoding for Sentence Simplification (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies have shown that lexically constrained decoding is effective for sentence simplification, but their constraints can be loose and may lead to sub-optimal generation. |
| Approach: | They propose an edit operation based on lexically constrained decoding for sentence simplification using a dictionary of technical terms as constraints. |
| Outcome: | The proposed method outperforms previous studies on English simplification corpora and is based on lexical paraphrasing. |
End-to-End Lexically Constrained Machine Translation for Morphologically Rich Languages (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to enforce word forms in translations struggle to make them agree with the rest of the output. |
| Approach: | They propose to train neural machine translation models with lemmatized constraints to infer correct word inflection. |
| Outcome: | The proposed model reduces errors in translation of constrained terms in automatic and manual evaluations on English-Czech language pairs. |
Negative Lexically Constrained Decoding for Paraphrase Generation (P19-1)
Copied to clipboard
| Challenge: | Paraphrase generation is a monolingual machine translation problem. |
| Approach: | They propose a neural model that first identifies words in the source sentence that should be paraphrased and then decodes them by negative lexical constraints. |
| Outcome: | The proposed model improves paraphrase generation by making necessary rewrites to an input sentence. |
Neural Machine Translation Decoding with Terminology Constraints (N18-2)
Copied to clipboard
| Challenge: | Constrained neural machine translation systems can provide excellent quality but do not strictly enforce terminology. |
| Approach: | They propose a framework for constrained neural decoding which supports target-side constraints as well as constraints with corresponding aligned input text spans. |
| Outcome: | The proposed framework performs well on multiple translation tasks and motivates the need for constrained decoding with attentions to reduce misplacement and duplication when translating user constraints. |
Lexically Constrained Neural Machine Translation with Levenshtein Transformer (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to incorporate lexical constraints in neural machine translation have been unsuccessful . |
| Approach: | They propose an algorithm that incorporates lexical constraints into neural machine translation. |
| Outcome: | The proposed method improves on English-German datasets without modification . it does not require any modification to the training procedure and can be easily applied at runtime with custom dictionaries. |
Improving Lexical Choice in Neural Machine Translation (N18-1)
Copied to clipboard
| Challenge: | False positives: the output layer rewards frequent words disproportionately, we argue . Falsibles: a model that learns word representations in continuous space tends to translate rare words . |
| Approach: | They propose to fix the norms of both vectors to a constant value and integrate a lexical module which is jointly trained with the rest of the model. |
| Outcome: | The proposed approach achieves improvements of up to +4.3 BLEU surpassing phrase-based translation in nearly all settings. |
Accurate Online Posterior Alignments for Principled Lexically-Constrained Decoding (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods of offline alignment use only the entire target sentence. |
| Approach: | They propose a posterior alignment technique that is truly online in its execution and superior in terms of alignment error rates compared to existing methods. |
| Outcome: | The proposed technique is online in execution and superior in alignment error rates compared to existing methods. |
Self-Ensemble of N-best Generation Hypotheses by Lexically Constrained Decoding (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have improved generation quality by explicitly reranking N-best candidates. |
| Approach: | They propose a method that ensembles N-best hypotheses to improve natural language generation by combining high-quality fragments of N- best hypothese . they use tokens that should or should not be present in the final output as lexical constraints to improve quality of generation. |
| Outcome: | Empirical results show that the proposed method outperforms strong N-best reranking methods on paraphrase generation, summarisation, and constrained text generation. |