Non-autoregressive Text Editing with Copy-aware Latent Alignments (2023.emnlp-main)
Copied to clipboard
| Challenge: | Seq2Edit approaches still face several challenges such as inflexibility in generation and difficulty in generalizing to other languages. |
| Approach: | They propose a non-autoregressive text editing method that models the edit process with latent CTC alignments and introduces the copy operation into the edit space. |
| Outcome: | The proposed method outperforms existing Seq2Edit models and achieves similar or even better results than Seq1Edit with over 4 speedup. |
Similar Papers
EdiT5: Semi-Autoregressive Text Editing with T5 Warm-Start (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Pre-trained seq2seq models have established strong baselines for text-to-text transduction tasks. |
| Approach: | They propose a semi-autoregressive text-editing approach that combines the strengths of non-auto-regressively text- editing and autoregressive decoding. |
| Outcome: | The proposed model is faster at inference times than conventional models while being capable of modeling flexible input-output transformations. |
Text Generation with Text-Editing Models (2022.naacl-tutorials)
Copied to clipboard
Eric Malmi, Yue Dong, Jonathan Mallinson, Aleksandr Chuklin, Jakub Adamek, Daniil Mirylenka, Felix Stahlberg, Sebastian Krause, Shankar Kumar, Aliaksei Severyn
| Challenge: | Text-editing models are a popular alternative to seq2seq for monolingual text generation tasks such as text summarization and style transfer. |
| Approach: | They propose to use text-editing models to predict edit operations applied to the source sequence and to generate outputs word-by-word from scratch. |
| Outcome: | This paper provides an overview of the text-edit based models and their current state-of-the-art approaches. |
Non-Autoregressive Machine Translation with Latent Alignments (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing non-autoregressive machine translation methods are lacking in the field of latent alignments. |
| Approach: | They propose two strong methods for non-autoregressive machine translation that model latent alignments with dynamic programming. |
| Outcome: | The proposed models achieve state-of-the-art on the WMT’14 EnDe task, compared with the autoregressive Transformer baseline. |
Seq2Edits: Sequence Transduction Using Span-level Edit Operations (2020.emnlp-main)
Copied to clipboard
| Challenge: | Seq2Edits is an open-vocabulary approach to sequence editing for natural language processing tasks with a high degree of overlap between input and output texts. |
| Approach: | They propose an open-vocabulary approach to sequence editing for NLP tasks with a high degree of overlap between input and output texts. |
| Outcome: | The proposed approach speeds up inference by up to 5.2x compared to full sequence models . it improves explainability by associating each edit operation with a human-readable tag. |
Can Latent Alignments Improve Autoregressive Machine Translation? (2021.naacl-main)
Copied to clipboard
| Challenge: | Latent alignment objectives improve non-autoregressive models, but can they improve autoregressive ones? e.g., we show that latent alignments are incompatible with teacher forcing. |
| Approach: | They propose latent alignment objectives that use a dynamic program to comb the space of monotonic alignments between the "gold" target sequence and token probabilities the model predicts. |
| Outcome: | The proposed models are incompatible with teacher forcing, the authors show . they show that latent alignment objectives reduce misalignments and focus on original error . |
NAST: A Non-Autoregressive Generator with Word Alignment for Unsupervised Text Style Transfer (2021.findings-acl)
Copied to clipboard
| Challenge: | Autoregressive text style transfer models often ignore part of the source sentence and generate some irrelevant words with strong styles. |
| Approach: | They propose a non-autoregressive generator for unsupervised text style transfer which explicitly models word alignments to suppress irrelevant words. |
| Outcome: | The proposed generator significantly improves performance and provides explainable word alignments. |
Context-Aware Non-Autoregressive Document-Level Translation with Sentence-Aligned Connectionist Temporal Classification (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing studies employ autoregressive translation (AT) methods to encode sentences . however, the AT methods struggle with error accumulation when the length of sentences increases. |
| Approach: | They propose a context-aware non-autoregressive framework with the sentence-aligned connectionist temporal classification loss for document-level neural machine translation. |
| Outcome: | The proposed framework achieves 46X speedup on three benchmarks compared to strong baselines. |
Investigating the Reordering Capability in CTC-based Non-Autoregressive End-to-End Speech Translation (2021.findings-acl)
Copied to clipboard
| Challenge: | Using connectionist temporal classification (CTC) for speech-to-text translation is counter-intuitive due to its monotonicity assumption. |
| Approach: | They propose to build a non-autoregressive speech-to-text translation model using connectionist temporal classification (CTC) their work shows transformer encoders can change the word order and points out the future research direction that needs to be explored more on non-Autoregressives speech translation. |
| Outcome: | The proposed model improves translation performance by using transformer encoders. |
Non-Autoregressive Neural Machine Translation: A Call for Clarity (2022.emnlp-main)
Copied to clipboard
| Challenge: | Non-autoregressive translation models require a single forward pass to generate the output sequence instead of iteratively producing each predicted token. |
| Approach: | They propose to use a single forward pass to generate the output sequence instead of iteratively producing each predicted token. |
| Outcome: | The proposed models improve translation quality and speed under third-party testing environments. |
GEC-DePenD: Non-Autoregressive Grammatical Error Correction with Decoupled Permutation and Decoding (2023.acl-long)
Copied to clipboard
| Challenge: | grammatical error correction is an important NLP task that is usually solved with autoregressive sequence-to-sequence models. |
| Approach: | They propose a non-autoregressive approach to grammatical error correction that decouples a permutation network and a decoder network that fills in specific tokens. |
| Outcome: | The proposed approach improves over previously known non-autoregressive methods and reaches the level of autoregressive approaches that do not use language-specific synthetic data generation methods. |