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. |
Similar Papers
BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension (2020.acl-main)
Copied to clipboard
Mike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad, Abdelrahman Mohamed, Omer Levy, Veselin Stoyanov, Luke Zettlemoyer
| Challenge: | Recent work has shown gains by improving the distribution of masked tokens and the order in which mucked tokens are predicted. |
| Approach: | They propose a denoising autoencoder for pretraining sequence-to-sequence models that corrupts text with an arbitrary noising function and learns a model to reconstruct the original text. |
| Outcome: | The proposed model outperforms RoBERTa on GLUE and SQUAD and provides a 1.1 BLEU increase over a back-translation system for machine translation. |
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 . |
PAIR: Planning and Iterative Refinement in Pre-trained Transformers for Long Text Generation (2020.emnlp-main)
Copied to clipboard
| Challenge: | We present a content-controlled text generation framework for pre-trained Transformers . large pre-train models are the cornerstone of many state-of-the-art models in natural language understanding and generation tasks. |
| Approach: | They propose a content-controlled text generation framework that adds content planning to large pre-trained Transformers without modifying model architecture. |
| Outcome: | The proposed framework improves the quality of the outputs on three domains. |
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. |
Controllable Paraphrase Generation for Semantic and Lexical Similarities (2024.lrec-main)
Copied to clipboard
| Challenge: | Lexically diverse paraphrases are crucial in data augmentation because they enhance the linguistic diversity of the corpus. |
| Approach: | They propose a controllable model for semantic and lexical similarities by attaching tags to the head of the input sentence. |
| Outcome: | The proposed model can paraphrase an input sentence according to the tags specified. |
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. |
POINTER: Constrained Progressive Text Generation via Insertion-based Generative Pre-training (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing pre-trained language models cannot be directly employed to generate text under specified lexical constraints. |
| Approach: | They propose a method for insertion-based text generation that inserts tokens between existing tokens in a parallel manner. |
| Outcome: | The proposed method is intuitive and interpretable on Wikipedia and Yelp datasets. |
LexFit: Lexical Fine-Tuning of Pretrained Language Models (2021.acl-long)
Copied to clipboard
| Challenge: | Transformer-based language models implicitly store a wealth of lexical semantic knowledge, but it is non-trivial to extract that knowledge effectively from their parameters. |
| Approach: | They propose to expose and enrich lexical knowledge from transformer-based language models to serve as effective decontextualized word encoders even when fed input words "in isolation" |
| Outcome: | The proposed model outperforms standard static WEs and vanilla LMs in lexical tasks over four established tasks in 8 languages. |
On the Role of Pre-trained Language Models in Word Ordering: A Case Study with BART (2022.coling-1)
Copied to clipboard
| Challenge: | Existing work uses linear models and neural networks for word ordering, yet pre-trained language models have not been studied in word ordering. |
| Approach: | They propose a constrained language generation task using unordered words as input. |
| Outcome: | The proposed model is able to perform better than existing models and proves to be reliable. |
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. |