Papers with seq2seq
Copied to clipboard
| 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. |
Copied to clipboard
| Challenge: | Existing frameworks for fine-grained few-shot entity extraction are difficult to implement in the chemical domain due to the information overload of scientific papers. |
| Approach: | They propose a sequence-to-sequence based few-shot entity extraction approach . it uses a seq2seq entity extractor and a self-validation module to reconstruct original input sentence . |
| Outcome: | The proposed framework achieves 8.26% and 6.84% performance gains on two datasets. |
Copied to clipboard
| Challenge: | Existing open-domain dialogue models fail to capture and utilize external knowledge, leading to repetitive or generic responses to unseen utterances. |
| Approach: | They propose to use social media comments to improve the raw conversation ability of open-domain dialogue systems. |
| Outcome: | The proposed model improves the raw conversation ability of open-domain dialogue systems by mimicking human responses through casual interactions found on social media. |
Copied to clipboard
| Challenge: | kNN-BOX enables quick development and visualization for novel generation paradigm . Currently, knn-BOx has provided implementation of seven popular kN-MT variants . |
| Approach: | They propose a framework which decomposes the datastore-augmentation approach into three modules . they apply kNN-BOX to machine translation and three other tasks . |
| Outcome: | The proposed framework decomposes the datastore-augmentation approach into three modules . it provides implementation of seven popular kNN-MT variants, covering research from performance enhancement to efficiency optimization. |
Copied to clipboard
| Challenge: | Historical linguists reconstruct proto-languages by identifying systematic sound changes that can be inferred from correspondences between attested daughter languages. |
| Approach: | They propose to update their Latin protoform reconstruction model with the Transformer . romance data of 8,000 cognates spanning 5 languages and Chinese dataset are outperformed . |
| Outcome: | The proposed model outperforms previous models on Romance and Chinese datasets. |
Copied to clipboard
| Challenge: | Neural generative models are becoming more popular when building conversational agents. |
| Approach: | They propose to study the sensitivity of neural dialog models to unnatural perturbations . they experiment with 10 different types of perturbations on 4 multi-turn dialog datasets . |
| Outcome: | The proposed model is sensitive to unnatural changes or perturbations on 4 multi-turn dialog datasets. |
Copied to clipboard
| Challenge: | Morphological segmentation for polysynthetic languages is challenging because of limited training data. |
| Approach: | They propose two new multi-task training approaches that improve performance for Mexican polysynthetic languages . they also propose cross-lingual transfer as a third way to fortify their neural model . |
| Outcome: | The proposed models improve on Mexicanero, Nahuatl, Wixarika and Yorem Nokki . the proposed models reduce the amount of parameters by close to 75% . |
Copied to clipboard
| Challenge: | a recent study shows transformer-based parsers struggle with disambiguating intents/slots and producing syntactically valid frames. |
| Approach: | They propose to use seq2seq transformers to map textual utterances to semantic frames . they propose to model transformer-based parsers across monolingual and multilingual settings . |
| Outcome: | The proposed parsers struggle with disambiguating intents/slots and produce syntactically valid frames. |
Copied to clipboard
| Challenge: | Existing methods for dialogue summarization consider roles separately where interactions among different roles are not fully explored. |
| Approach: | They propose a novel role-aware centrality model to capture role interactions by involving role prompts to control what kind of summary to generate. |
| Outcome: | The proposed model achieves state-of-the-art on two public benchmark datasets, CSDS and MC. |
Copied to clipboard
| Challenge: | Existing approaches for document summarization use manual feature engineering, integer linear programming and data-driven approaches. |
| Approach: | They propose a framework that encodes the source text first with a transformer, then a sequence-to-sequence model. |
| Outcome: | The proposed framework improves performance on extractive and abstractive document summarization task using the CNN/DailyMail and Newsroom datasets. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is traditionally approached as a sequence labeling task where a tag is predicted for each token. |
| Approach: | They propose to convert a Named Entity Recognition task into a seq2seq task by generating synthetic sentences using templates. |
| Outcome: | The proposed model outperforms the current state-of-the-art approach in resource-rich, low resource and domain transfer settings and the negative examples play an important role in its performance. |
Copied to clipboard
| Challenge: | In recent years, the emergence of seq2seq models has revolutionized the field of machine translation by replacing traditional phrase-based approaches with neural machine translation (NMT) systems based on the encoder-decoder paradigm. |
| Approach: | They propose to use a convolutional seq2seq model to combine the strengths of the two approaches. |
| Outcome: | The proposed architectures outperform the existing models on the WMT’14 benchmark dataset. |
Copied to clipboard
| Challenge: | a common and mostly adopted method is the rule-based (or template-based) method for natural language generation. |
| Approach: | They propose a hierarchical decoding NLG model based on linguistic patterns in different levels. |
| Outcome: | The proposed method outperforms the traditional one with a smaller model size. |
Copied to clipboard
| Challenge: | Recent coreference resolution systems use search algorithms to identify mentions and resolve coreference. |
| Approach: | They propose a text-to-text coreference resolution system that uses a semantic paradigm to predict mentions and links jointly. |
| Outcome: | The proposed system achieves state-of-the-art accuracy on CoNLL-2012 datasets with 83.3 F1-score for English, 68.5 F1 score for Arabic, and 74.3 F1 scores for Chinese. |
Copied to clipboard
| Challenge: | Increasing concerns and regulations about data privacy necessitate the study of privacy-preserving, decentralized learning methods for natural language processing tasks. |
| Approach: | They propose a framework for evaluating federated learning methods on four different tasks . they propose federation between Transformer-based language models and FL methods . |
| Outcome: | The proposed framework compares FL methods on four different tasks under non-IID partitioning strategies. |
Copied to clipboard
| Challenge: | Typical event sequences are important class of commonsense knowledge . previous work in event prediction uses sequence-to-sequence models . however, what can happen after a given event is usually diverse . |
| Approach: | They propose to incorporate a conditional variational autoencoder into seq2seq for its ability to represent diverse next events as a probabilistic distribution. |
| Outcome: | The proposed model outperforms deterministic models in terms of precision and recall . the proposed model is based on a conditional variational autoencoder . |
Copied to clipboard
| Challenge: | Current approaches to visual dialog learning involve an end-to-end framework that maps the multi-modal context to a deep vector and in order to decode a natural dialog response. |
| Approach: | They propose a framework that trains a RL policy for image guessing and a seq2seq model to improve dialog quality. |
| Outcome: | The proposed framework achieves state-of-the-art performance on a guessWhich task . it can be applied to a wide range of tasks including assisting blind people . |
Copied to clipboard
| Challenge: | a typical goal for language understanding is to logically connect the events of a discourse, but connective events are not described due to their commonsense nature. |
| Approach: | They propose a system that generates unique and diverse preconditions by using an event sampler, candidate generator, and post-processor. |
| Outcome: | The proposed system can generate unique and diverse preconditions without training on diverse examples. |
Copied to clipboard
| Challenge: | Existing summarization systems rely on the source text to generate summaries, which tends to work unstably. |
| Approach: | They propose to use existing summaries as soft templates to guide the seq2seq model . they use a popular IR platform to Retrieve proper summary as candidate templates . |
| Outcome: | The proposed model outperforms state-of-the-art models in terms of informativeness and readability. |
Copied to clipboard
| Challenge: | Existing tools for modeling and understanding models are limited . existing tools can assist practitioners in understanding and evaluating models . |
| Approach: | They present an open-source platform for visualization and understanding of NLP models. |
| Outcome: | The language interpretability tool (lit) is an open-source platform for visualization and understanding of NLP models. |
Copied to clipboard
| Challenge: | Sequence-to-sequence semantic parsers with attention mechanisms have changed the research landscape . emergence of seq2seq models have led to questions about alignments . |
| Approach: | They investigate whether seq2seq models can handle both simple and complex alignments. |
| Outcome: | The proposed model performs better on monotonic and complex alignments compared to monotonic models . |
Copied to clipboard
| Challenge: | Existing approaches that model alignments between sentences fail at compositional generalization tasks, resulting in a resurgence of such approaches. |
| Approach: | They propose a two-step approach that first translates input sentences monotonically and then reorders them to obtain the correct output. |
| Outcome: | The proposed approach improves compositional generalization over existing models and other approaches that exploit gold alignment annotations. |
Copied to clipboard
| Challenge: | LINGUIST generates annotated data for Intent Classification and Slot Tagging (IC+ST) we demonstrate fine-tuning of a large-scale seq2seq model to control outputs of multilingual data generation. |
| Approach: | They propose a method for generating annotated data for Intent Classification and Slot Tagging (IC+ST) they use a 5-billion-parameter multilingual sequence-to-sequence model to fine-tune it on a flexible instruction prompt. |
| Outcome: | The proposed method outperforms state-of-the-art approaches on a SNIPS intent setting and shows significant improvement on IC+ST in a cross-lingual setting. |
Copied to clipboard
| Challenge: | Recent work on semantic parsing has shown that seq2seq models find compositional generalization challenging. |
| Approach: | They propose a data-augmentation strategy that exploits alignment annotations between sentences and their corresponding meaning representations to improve compositional generalization. |
| Outcome: | The proposed model improves compositional generalization performance by exploiting alignment annotations between sentences and their corresponding meaning representations. |
Copied to clipboard
| Challenge: | a finite state transducer defines joint and conditional probability distributions over strings . a weighted finite-state transducers can only model certain functions, known as the rational relations . |
| Approach: | They propose a family of string transduction models defining joint and conditional probability distributions over pairs of strings. |
| Outcome: | The proposed models are more powerful than previous finite-state models with neural features. |
Copied to clipboard
| Challenge: | Text normalization (TN) is an important step in conversational systems. |
| Approach: | They frame text normalization as a machine translation task and tackle it with sequence-to-sequence models. |
| Outcome: | The proposed model normalizes written text to its spoken form to facilitate speech recognition and text-to-speech synthesis. |
Copied to clipboard
| Challenge: | Compositional generalization is the ability of a system to correctly predict the meaning of complex sentences when trained on simpler sentences. |
| Approach: | They propose to use data augmentation methods to generate additional training data by sampling from an augmentation distribution to generalize to the out-of-distribution test data. |
| Outcome: | The proposed method outperforms existing methods that sampled from the training distribution and outperformed existing methods. |
Copied to clipboard
| Challenge: | In contrast, adversarial training has been used in computer vision to improve models’ robustness due to the discrete nature of text. |
| Approach: | They propose a way to generate adversarial samples by using pseudo-labeled in-domain text data to train a seq2seq model for adversarials and combine it with paraphrase detection. |
| Outcome: | The proposed model generates realistic and relevant adversarial samples compared to other state-of-the-art models and recovers up to 70% of errors. |
Copied to clipboard
| Challenge: | Sentiment ambiguous lexicons are used when context is absent in translations . most systems aim to produce one correct translation for a given source sentence . |
| Approach: | They propose a neural machine translation method that preserves sentiment in two sentiment scenarios and a method that embeds sentiment into a sentence. |
| Outcome: | The proposed method outperforms a baseline with sentiment-aware translations in both the BLEU score and translation accuracy. |
Copied to clipboard
| Challenge: | Existing methods for generating paraphrases fall into one of these broad categories -rule-based, seq2seq, deep generative models and a varied combination. |
| Approach: | They propose a framework that combines transformer and sequence-to-sequence models for better quality of generated paraphrases. |
| Outcome: | The proposed framework improves on two datasets-QUORA and MSCOCO using transformer and sequence-to-sequence models. |
Copied to clipboard
| Challenge: | Existing models for abstractive summarization suffer from repetition and semantic irrelevance. |
| Approach: | They propose a global encoding framework which controls the information flow from the encoder to the decoder based on the global information of the source context. |
| Outcome: | The proposed model outperforms baseline models on the LCSTS and English Gigaword and can generate summary of higher quality and reduce repetition. |
Copied to clipboard
| Challenge: | Text style transfer is a text generation task where a given sentence must be rewritten changing its style while preserving its meaning. |
| Approach: | They propose a modular approach for multilingual formality transfer using machine translated data and gold aligned English sentences. |
| Outcome: | The proposed approach achieves competitive performance without monolingual task-specific parallel data and can be applied to other style transfer tasks as well as to other languages. |
Copied to clipboard
| Challenge: | Graph-based semantic parsing is one of the most promising general-purpose meaning representations . owing to this heterogeneity, most research focused on solutions specific to a given formalism . |
| Approach: | They propose a multilingual neural machine translation framework for Graph-based semantic parsing . they propose Graph2seq architecture that trains with an MNMT objective . |
| Outcome: | The proposed framework outperforms all competitors on cross-lingual parsing tasks. |
Copied to clipboard
| Challenge: | Existing summarization models that can extract the top few lines of news articles fail to summarize long documents. |
| Approach: | They constructed a scientific summarization dataset from MEDLINE articles from the PubMed archive to address this problem. |
| Outcome: | The proposed model outperforms existing models on news article summarization datasets and shows that it is more efficient to extract the top few lines. |
Copied to clipboard
| Challenge: | Typographical errors (typos) also occur in user generated content (UGC). |
| Approach: | They extract over half a million Japanese typo–correction pairs from Wikipedia’s revision history and combine character-based extraction rules, morphological analyzers to guess readings, and various filtering methods to address these challenges. |
| Outcome: | The proposed dataset extracts over half a million typo–correction pairs from Wikipedia’s revision history. |
Copied to clipboard
| Challenge: | Neural networks are surprisingly good at interpolating, but they are often unable to extrapolate patterns beyond the seen data. |
| Approach: | They propose to use a special type of extrapolation for natural language processing to generalize to sequences that are longer than the training ones. |
| Outcome: | The proposed model is more likely to extrapolate than models with common attention mechanisms. |
Copied to clipboard
| Challenge: | Recent advances in natural language processing have led to the availability of large pre-trained language models with rich generative capabilities. |
| Approach: | They propose a method to combine generative LMs with attribute discriminators to control different attributes of text generation. |
| Outcome: | The proposed method performs better than existing state-of-the-art approaches in sentiment steering and machine translation formality tasks. |
Copied to clipboard
| Challenge: | Pretraining and fine-tuning language models is a common practice in NLP, but deploying general-purpose language models without the abundant computation or data resources is proving difficult. |
| Approach: | They propose a sequence-to-sequence language model architecture that can be more practical and compute-efficient than the decoder-oriented approach. |
| Outcome: | The proposed language model outperforms competing models in Korean benchmarks and is more efficient in low-resource settings. |
Copied to clipboard
| Challenge: | Existing graph-based approaches for semantic parsing fail on compositional generalization tasks. |
| Approach: | They propose a graph-based approach for semantic parsing that solves two problems . they propose two algorithms based on constraint smoothing and conditional gradient to approximate these problems. |
| Outcome: | The proposed graph-based approach delivers state-of-the-art results on GeoQuery, Scan, and Clevr . |
Copied to clipboard
| Challenge: | Currently, the framework supports text classification, sequence tagging, and seq2seq tasks. |
| Approach: | They propose an open-source framework for active learning annotation in natural language processing that provides an easy-to-deploy GUI annotation tool directly in the Jupyter IDE. |
| Outcome: | The proposed framework reduces computational overhead and duration of AL iterations and increases annotated data reusability. |
Copied to clipboard
| Challenge: | Inverse Text Normalisation (ITN) is a textrewriting task that converts verbalized text to written form. |
| Approach: | They propose to use a seq2seq model, a non-autoregressive text editor and a sequence tagger + rules combination to fine-tune three pre-trained neural models. |
| Outcome: | The proposed model improves with bootstrapping and data augmentation, and bootstrap alone shows a percentage improvement of 14.12 %. |
Copied to clipboard
| Challenge: | Existing knowledge graph question answering systems are limited to simple questions, but they can be used to answer complex questions. |
| Approach: | They propose a multilingual Knowledge Graph Question Answering technique that orders potential responses based on the distance between the question’s text embeddings and the answer’s graph embedds. |
| Outcome: | The proposed method consistently outperforms baseline systems, including seq2seq QA models and complex rule-based pipelines. |
Copied to clipboard
| Challenge: | Despite the promising evaluation results by knowledge distillation (KD) in natural language understanding (NLU) and sequence-to-sequence (seq2sequ) tasks, KD for causal language modeling (LM) remains a challenge. |
| Approach: | They propose to use external logits to improve a student's kNN-LM by leveraging teacher's knowledge at test time. |
| Outcome: | The proposed method improves a student's kNN-LM in multiple language modeling datasets and improves perplexity. |
Copied to clipboard
| Challenge: | Recent fact verification systems rely on neural network classifiers for veracity prediction, which lack explainability. |
| Approach: | They propose a model that generates natural logic-based inferences as proofs using lexical mutations between spans in the claim and the evidence retrieved. |
| Outcome: | The proposed model has highest label accuracy and second best score in the FEVER leaderboard. |
Copied to clipboard
| Challenge: | Existing methods for sentiment transfer have relied on unsupervised methods due to lack of parallel corpora. |
| Approach: | They propose a method for creating parallel data to train Seq2Seq neural networks for sentiment transfer. |
| Outcome: | The proposed method outperforms existing unsupervised methods in sentiment transfer tasks. |
Copied to clipboard
| Challenge: | despite success of sequence-to-sequence models, they fail in compositional generalization . a span-based parser that predicts a utterance over spans improves performance . |
| Approach: | They propose a span-based parser that predicts a utterance over a given span tree . they propose to use CKY to encode how partial programs compose over spans . |
| Outcome: | The proposed model performs better on random splits than baselines that require compositional generalization. |
Copied to clipboard
| Challenge: | Existing methods for verification of claims are limited by the availability of labeled data. |
| Approach: | They propose a method that explores the alignment between a claim and its evidence using a seq2seq model and a novel semantic measure. |
| Outcome: | The proposed method shows significant performance improvements over baselines SEED, PET and LLaMA 2 across three fact-checking datasets. |
Copied to clipboard
| Challenge: | a recent study shows that accessing medical literature is difficult for laypeople because it is written for specialists and contains medical jargon. |
| Approach: | They propose a two-stage strategy to identify relevant content to be simplified . they first generate reference summaries via sentence matching between the original and simplified abstracts . |
| Outcome: | The proposed approach improves on a seq2seq-based test set on an English medical corpus . it also improves the SARI score by 1.1% . |
Copied to clipboard
| Challenge: | Sequence-to-sequence (seq2sequ) models have been successful in semantic parsing tasks but struggle on out-of-distribution data. |
| Approach: | They propose to use a large-scale dialogue dataset to evaluate compositional generalization of semantic parsing. |
| Outcome: | The proposed model outperforms BART- and T5-based models on the SMCalflow-CS dataset on the zero-shot learning task. |
Copied to clipboard
| Challenge: | Currently, eCommerce platforms use schema matching to structure product information from disparate sources. |
| Approach: | They propose to model the schema matching problem as a neural machine translation task . they propose to use open-source seq2seq models fine-tuned on product attribute mappings to build a framework . |
| Outcome: | The proposed model achieves a significant performance boost (15% precision and 7% recall uplift) it can support new attributes with precision 95% using only five labeled samples per attribute. |
Copied to clipboard
| Challenge: | Sequence-to-sequence (seq2sequ) models are a ubiquitous tool for text generation but they are not suitable for many other tasks. |
| Approach: | They propose to use UE techniques to identify out-of-domain (OOD) inputs where the model is susceptible to errors. |
| Outcome: | The proposed methods outperform heavyweight ensembles on the task of OOD detection. |
Copied to clipboard
| Challenge: | Generating long form narratives from multiple modalities requires a model to learn surrounding contextual information by masking spans of input while decoding attempts in generating the entire text. |
| Approach: | They propose to use infilling techniques to generate textual descriptions from images that are rich in contextual dependencies. |
| Outcome: | The proposed model outperforms existing models in visual storytelling by generating text from a large scale dataset of 46,200 procedures and 340k pairwise images and textual descriptions. |
Copied to clipboard
| Challenge: | Inflection tasks have gained a lot of traction in recent years, mostly via SIGMORPHON's shared-tasks. |
| Approach: | They propose to use split-by-lemma to challenge the generalization capacity of morphological inflection models by employing harder train-test splits. |
| Outcome: | The proposed method is based on a split-by-lemma method that challenges the generalization capacity of the models. |
Copied to clipboard
| Challenge: | Seq2seq models for grammatical error correction (GEC) have two limitations: (1) a seq2q model may not be well generalized with only limited error-corrected data; (2) a model may fail to completely correct a sentence with multiple errors through normal seq1sequeq inference. |
| Approach: | They propose a fluency boost learning and inference mechanism to improve the performance of seq2seq models for grammatical error correction (GEC) by generating fluency-boost sentence pairs during training. |
| Outcome: | Experiments show that the proposed model improves on both CoNLL-2014 and JFLEG benchmark datasets. |
Copied to clipboard
| Challenge: | a generic transformer-based model can achieve competitive performance with minimal code-generation-specific inductive bias design. |
| Approach: | They investigate whether a generic transformer-based seq2seq model can achieve competitive performance with minimal code-generation-specific inductive bias design. |
| Outcome: | The proposed model achieves 81.03% exact match accuracy on Django and 32.57 BLEU score on CoNaLa. |
Copied to clipboard
| Challenge: | Using a pre-trained dataset, we examine how well recent neural models capture compositionality in symbolic reasoning tasks. |
| Approach: | They propose a skill tree on compositionality that defines hierarchical levels of complexity along with three compositionality dimensions: systematicity, productivity, and substitutivity. |
| Outcome: | The proposed model struggled most with systematicity, performing poorly even with relatively simple compositions. |
Copied to clipboard
| Challenge: | Semantic parsing is a key role in voice assistants by mapping natural language to structured meaning representations. |
| Approach: | They propose an architecture to perform domain adaptation automatically with only a small amount of metadata about the new domain and without any new training data. |
| Outcome: | The proposed architecture outperforms existing models in low-resource settings. |
Copied to clipboard
| Challenge: | Sequence-to-sequence models fail to generalize in hierarchy-sensitive manner when performing syntactic transformations. |
| Approach: | They evaluate whether seq2seq models generalize hierarchically on two transformations . they use pre-trained models and their multilingual variants to test their generalization . |
| Outcome: | The proposed models generalize hierarchically on two transformations in English and German. |
Copied to clipboard
| Challenge: | A large-scale dataset is collected from Chinese microblog Sina Weibo with over 13 thousand trending topics, emotion votes in 24 fine-grained types from massive participants, and user comments to allow context understanding. |
| Approach: | They use a large-scale dataset from Chinese microblog Sina Weibo to examine readers' responses to online discussion topics. |
| Outcome: | The proposed model outperforms the human model in predicting social emotions in a multilabel classification setting. |
Copied to clipboard
| Challenge: | Recent studies show that sequence-to-sequence (seq2sequ) models struggle with compositional generalization (CG) a crucial property of human language learning is its compositional globalization (GC), the algebraic ability to understand and produce a potentially infinite number of novel combinations from known components. |
| Approach: | They propose a sequence-to-sequence (seq2sequ) extension which learns to compose representations of different encoder layers dynamically for different tasks. |
| Outcome: | The proposed model achieves competitive results on two comprehensive and realistic benchmarks, which empirically demonstrates the effectiveness of the proposed model. |
Copied to clipboard
| Challenge: | Obtaining the proper word ordering, called as the prose ordering, from a verse is often considered a task which requires linguistic expertise. |
| Approach: | They propose a word ordering (linearisation) task that ignores the word arrangement at the verse side. |
| Outcome: | The proposed model outperforms current models in word ordering for the translation task in Sanskrit. |
Copied to clipboard
| Challenge: | FELIX is efficient in low-resource settings and fast at inference time, while being capable of modeling flexible input-output transformations. |
| Approach: | They propose a flexible text-editing approach that decomposes a text-generating task into two sub-tasks: tagging and insertion. |
| Outcome: | The proposed model is efficient in low-resource settings and fast at inference time while being capable of modeling flexible input-output transformations. |
Copied to clipboard
| Challenge: | a dataset mapping a complex sentence to a sequence of sentences conveying the same meaning is challenging in NLP. |
| Approach: | They propose a neural split and a copy-mechanism to break a complex sentence into several shorter sentences that convey the same meaning. |
| Outcome: | The proposed model outperforms the baseline model by 8.68 BLEU and further improves on the task. |
Copied to clipboard
| Challenge: | String transduction and sequence labeling are often treated as separate entities and often give treatment to different problems in NLP. |
| Approach: | They propose to reduce string transduction to sequence labeling by using a finite-state technique that uses string transducing and sequence labelling. |
| Outcome: | The proposed method performs better than seq2seq models and yields state-of-the-art results in several cases. |
Copied to clipboard
| Challenge: | Extreme multi-label classification (XMC) aims at tagging content with subset of labels from an extremely large label set. |
| Approach: | They propose a model that predicts a set of labels outside of the known vocabulary by using a loss-dependent loss-based loss-free model. |
| Outcome: | The proposed model can predict labels outside the known vocabulary while performing on par with state-of-the-art solutions for known labels. |
Copied to clipboard
| Challenge: | Task-oriented semantic parsing is a new approach to represent the meaning of user requests with arbitrarily nested semantics. |
| Approach: | They propose to use knowledge-enhanced encoders to parse user requests with arbitrarily nested semantics. |
| Outcome: | The proposed model improves performance in low-resource and low-compute settings. |
Copied to clipboard
| Challenge: | Fig. 1 shows a document level discourse parser that performs top-down end-to-end parsing without requiring segmentation . |
| Approach: | They propose a top-down end-to-end formulation of document level discourse parsing in the Rhetorical Structure Theory framework. |
| Outcome: | The proposed model outperforms existing methods in end-to-end parsing and parse with gold segmentation without handcrafted features. |
Copied to clipboard
| Challenge: | Existing solutions to task-oriented dialogue systems follow pipeline designs which introduces complexity and fragility. |
| Approach: | They propose a novel sequence-to-sequence (seq2sequ) model which tracks dialogue believes and a two stage copynet instantiation which emonstrates good scalability. |
| Outcome: | The proposed framework outperforms state-of-the-art pipeline-based methods on large datasets and retains satisfactory entity match rate on out-of vocabulary (OOV) cases where pipeline-designed competitors totally fail. |
Copied to clipboard
| Challenge: | Using a pre-trained seq2seq model, we can discern which text is more difficult from two given texts (pairwise). |
| Approach: | They propose to adapt a pre-trained seq2seq model to discern which text is more difficult from two given texts (pairwise). |
| Outcome: | The proposed model can be adapted to discern which text is more difficult from two given texts (pairwise). |
Copied to clipboard
| Challenge: | Local sequence transduction tasks involve massive overlapping between source and target sequences . experimental results show that Pseudo-Bidirectional Decoding improves performance of standard seq2seq models. |
| Approach: | They propose a simple but versatile approach for local sequence transduction tasks . they propose to copy source tokens to decoder as pseudo future context . |
| Outcome: | The proposed approach improves the performance of standard seq2seq models on LST tasks. |
Copied to clipboard
| Challenge: | a proposed model for generating natural language descriptions is too generic and does not exploit task specific characteristics. |
| Approach: | They propose a model which uses a fused bifocal attention mechanism to exploit micro and macro level information and a gated orthogonalization mechanism to ensure that a field is remembered for a few time steps and then forgotten. |
| Outcome: | The proposed model improves on a recently released dataset with two similar datasets for French and German. |
Copied to clipboard
| Challenge: | Existing approaches to event detection focus on using syntactic dependency structures or external knowledge to boost the performance. |
| Approach: | They propose a graph parsing problem that explicitly models multiple event correlations and utilizes rich information conveyed by event type and subtype. |
| Outcome: | The proposed model outperforms existing models on the public ACE2005 dataset by 4.2% on the dataset. |
Copied to clipboard
| Challenge: | Existing approaches to grammatical error correction (GEC) use sequence-to-sequence models, but there is an exposure bias problem. |
| Approach: | They propose a data manipulation approach to overcome the exposure bias problem in seq2seq GEC . they propose augmentation methods to mimic decoder input and reweighting methods to automatically balance the importance of each kind of augmented samples. |
| Outcome: | The proposed method improves on benchmark GEC datasets. |
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. |
Copied to clipboard
| Challenge: | Seq2seq models struggle with compositional generalisation, i.e. generalising to new and potentially more complex structures than seen during training. |
| Approach: | They propose a flexible end-to-end differentiable neural model that composes two structural operations: a fertility step and a reordering step. |
| Outcome: | The proposed model outperforms seq2seq models on compositional splits of realistic semantic parsing tasks. |
Copied to clipboard
| Challenge: | a novel approach to map utterances to semantic frames is based on non-autoregressive parsers that shift the decoding task from text generation to span prediction. |
| Approach: | They propose a non-autoregressive, task-oriented parser which shifts the decoding task from text generation to span prediction and produces endpoints as opposed to text. |
| Outcome: | The proposed model bridges the quality gap between non-autoregressive and autoregressive parsers, achieving 87 EM on TOPv2 and shows a 70% reduction in latency and 83% reduction in memory at beam size 5 compared to prior non-regressives. |
Copied to clipboard
| Challenge: | Existing models with seq2seq framework lack ability to effectively manage concept transitions . lack of concept management strategies might lead to incoherent dialogue due to loosely connected concepts . |
| Approach: | They propose a concept-guided non-autoregressive model for open-domain dialogue generation that learns to identify multiple associated concepts from a conceptual graph and a customized Insertion Transformer to perform concept-directed generation to complete a response. |
| Outcome: | The proposed model outperforms state-of-the-art models in automatic and human evaluations with substantially faster inference speed. |
Copied to clipboard
| Challenge: | Existing studies have reported that clinicians read the IMPRESSION as they have less time to review findings. |
| Approach: | They propose to augment salient ontological terms into the abstractive summarizer by augmenting salient ontologies into the semantic summariser. |
| Outcome: | The proposed model significantly improves state-of-the-art results in terms of ROUGE metrics on two publicly available clinical data sets. |
Copied to clipboard
| Challenge: | Yin and Neubig (2018) identify four key components of importance for natural language to code translation. |
| Approach: | They propose a seq2seq-based architecture that relies on a grammar-based decoder and a lexical substitution component for natural language to code translation. |
| Outcome: | The proposed architecture relies on a grammar-based decoder and a BERT encoder . the proposed architecture is based on lexical substitutions in natural language to code translation . |
Copied to clipboard
| Challenge: | a pipeline translation method is proposed to take advantage of the similarities and differences between sign language and spoken language. |
| Approach: | They propose a pipeline translation method that takes advantage of similarities between spoken and spoken Japanese . they map glosses to spoken language words and train them using a monolingual Japanese corpus . |
| Outcome: | The proposed method performs robustly on the low-resource corpus and is +4.4/+4.9 points above baseline. |
Copied to clipboard
| Challenge: | Existing methods for information extraction are not well understood . text-to-table is a problem that aims to extract information from text data . |
| Approach: | They propose a new problem setting of information extraction, called text-to-table . they formalize text- to-table as a sequence-tosequence problem . |
| Outcome: | The proposed method outperforms existing methods on text-to-table tasks. |
Copied to clipboard
| Challenge: | Existing methods to measure instance difficulty use generalization and threshold-tuning . a new approach to learn to exit is based on hash functions to assign tokens to a fixed exiting layer. |
| Approach: | They propose a Hash-based Early Exiting approach that replaces learn-to-exit modules with hash functions to assign each token to a fixed exiting layer. |
| Outcome: | The proposed approach improves on learning to exit and predicting instance difficulty. |
Copied to clipboard
| Challenge: | Existing methods to solve the word mismatch between queries and documents are often inadequate to integrate geographic information into the pre-training model. |
| Approach: | They propose to train a pre-training model to integrate semantics and geographic information in the pre-trained representations of POIs. |
| Outcome: | The proposed model achieves excellent accuracy on a wide range of real-world datasets of map services. |
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR) parsing is limited by the size of curated datasets. |
| Approach: | They propose a seq2seq pre-training approach to build pre-trained models on three relevant tasks. |
| Outcome: | The proposed model improves performance on three relevant tasks while maintaining the response of pre-trained models. |
Copied to clipboard
| Challenge: | Existing models for knowledge-intensive language tasks require access to large, external knowledge sources. |
| Approach: | They propose a benchmark for knowledge-intensive language tasks (KILT) they test a shared dense vector index coupled with a seq2seq model to generate disambiguated text. |
| Outcome: | The proposed model outperforms tailor-made approaches on fact checking, open-domain question answering and dialog by generating disambiguated text. |
Copied to clipboard
| Challenge: | Existing approaches to extract relation triplets from text often involve multiple-step pipelines that propagate errors or are limited to a small number of relation types. |
| Approach: | They propose to use autoregressive seq2seq models to simplify Relation Extraction by expressing triplets as a sequence of text and a model that performs end-to-end relation extraction for more than 200 different relation types. |
| Outcome: | The proposed model achieves state-of-the-art on an array of Relation Extraction and Relation Classification benchmarks and achieves top performance in most of them. |
Copied to clipboard
| Challenge: | Existing approaches to automatic related work summarization rely on human-engineered features. |
| Approach: | They propose a neural data-driven attention mechanism to measure contextual relevance within full texts and a heterogeneous bibliography graph simultaneously. |
| Outcome: | The proposed approach achieves significant improvement over a typical seq2seq summarization baseline and five classical summarizing baselines. |
Copied to clipboard
| Challenge: | Existing methods for automating online advertising use open data . subdomains of text vary in use and can lead to reduced quality of adverts generation. |
| Approach: | They propose a neural network-based approach for the automatic generation of online advertising using texts from given webpages as sources. |
| Outcome: | The proposed approach significantly improves the quality of online advertising generated on a Russian dataset. |
Copied to clipboard
| Challenge: | Experimental results show RASAT can leverage a variety of relational structures while inheriting the pretrained parameters from the T5 model. |
| Approach: | They propose a Transformer seq2seq architecture augmented with relation-aware self-attention that leverages relational structures while inheriting pretrained parameters from the T5 model. |
| Outcome: | The proposed model can leverage relational structures while inheriting pretrained parameters from the T5 model effectively. |
Copied to clipboard
| Challenge: | Paraphrases refer to texts that convey the same meaning with different expression forms. |
| Approach: | They propose to incorporate a diversity loss term into a deep generative model to generate diverse paraphrases. |
| Outcome: | The proposed model can generate more diverse paraphrases compared with baselines. |
Copied to clipboard
| Challenge: | Using retrieve-and-edit methods, text generation methods can be improved by reranking outputs from training sets and learning models to produce the final output. |
| Approach: | They propose to extend retrieve-and-edit seq2seq methods with a simple post-generation ranking approach that retrieves multiple outputs and edits each independently to produce the final output. |
| Outcome: | The proposed approach outperforms existing methods on two machine translation datasets and shows room for improvement with better candidate output selection in future work. |
Copied to clipboard
| Challenge: | Existing methods for grammatical error correction are data-hungry and it is hard to train a seq2seq model with good performance without suf-Clean. |
| Approach: | They propose a method inspired by adversarial training to generate more meaningful and valuable training examples by continually identifying weak spots of a model and to enhance the model by gradually adding adversarials to the training set. |
| Outcome: | The proposed method improves generalization and robustness of GEC models by adding adversarial examples to the training set. |
Copied to clipboard
| Challenge: | Existing studies train task-specific generators, relying on training a model for every perturbation. |
| Approach: | They propose a semantically-controlled text generation system that modifies sentences to match target attributes. |
| Outcome: | The proposed system produces textual outputs conditioned on control codes derived from semantic representations. |
Copied to clipboard
| Challenge: | Semantic parsers struggle to generalize to examples with unseen combinations of seen rules from the training set. |
| Approach: | They propose a general framework to produce semantic parses by predicting node labels for a complete multi-layer input-aligned graph. |
| Outcome: | The proposed framework produces better generalizations than the baseline framework . it produces representations directly as a graph and not as sequences . |
Copied to clipboard
| Challenge: | Existing methods to graft pre-trained (masked) language models to multilingual data are limited, and they lack cross-attention component. |
| Approach: | They propose to graft separately pre-trained (masked) language models for machine translation using monolingual data and parallel data. |
| Outcome: | The proposed method achieves average improvements of 5.8 BLEU in x2en and 2.9 BLUE in en2x directions compared with the multilingual Transformer of the same size. |
Copied to clipboard
| Challenge: | Pre-trained seq2seq models suffer from a prediction bias due to their unidirectional decoding. |
| Approach: | They propose a bidirectional Transformer reranker that re-estimates the probability of each candidate sentence generated by pre-trained seq2seq models. |
| Outcome: | The proposed model improves on the original model and gives a 59.52 GLEU score on the JFLEG corpus. |
Copied to clipboard
| Challenge: | Semantic parsing using sequence-to-sequence models is stymied by higher compute requirements and higher latency. |
| Approach: | They propose a non-autoregressive approach to predict semantic parse trees with an efficient seq2seq model architecture. |
| Outcome: | The proposed architecture achieves an 81% reduction in latency on TOP dataset and retains competitive performance over non-pretrained models on three different semantic parsing datasets. |
Copied to clipboard
| Challenge: | Existing methods to extract words from source posts to form keyphrases do not exploit latent topics. |
| Approach: | They propose a sequence-to-sequence-based neural keyphrase generation framework . it allows absent keyphrases to be created, and it allows joint modeling of latent topic representations . |
| Outcome: | The proposed model outperforms extraction and generation models without exploiting latent topics. |
Copied to clipboard
| Challenge: | a new study examines the role of hyperpartisan content in online polarization in the social web. |
| Approach: | They propose a human-supervised parallel corpus for italian hyperpartisan neutralization of 2,475 paragraph pairs. |
| Outcome: | The proposed dataset is the first human-supervised parallel corpus for italian hyperpartisan neutralization of 2,475 paragraph pairs. |
Copied to clipboard
| Challenge: | Morphological inflection is a sequence-to-sequence task that sees great performance when data is plentiful, but performance falls off sharply in lower-data settings. |
| Approach: | They hypothesize that teacher forcing increases the likelihood that a model too closely models its training data. |
| Outcome: | Experiments show that teacher forcing can overfit models when they enter unknown territory. |
Copied to clipboard
| Challenge: | Existing weighted sum models (WSMs) take inputs and generate one output, but they are independent of each other and are fixed for all inputs. |
| Approach: | They propose adaptive weighting for WSMs to control the contribution of each input and output state. |
| Outcome: | The proposed weighting improves translation accuracy by 1.49 and 0.92 BLEU points on Chinese-to-English translation and English-to German translation tasks. |
Copied to clipboard
| Challenge: | Experimental results show draft-then-verify paradigm can achieve around 5x speedup for the popular Transformer architectures with comparable generation quality to beam search decoding. |
| Approach: | They propose to use Spec-Drafter and Spec Verification to accelerate autoregressive (AR) decoding by combining a model optimized for efficient and accurate drafting and a reliable method for verifying the drafted tokens efficiently. |
| Outcome: | The proposed method achieves 5x speedup on seq2seq tasks with comparable generation quality to beam search decoding, refreshing the impression that draft-then-verify paradigm introduces only 1.4x2x speed up. |
Copied to clipboard
| Challenge: | Problem list summarization requires a model to understand, abstract, and generate clinical documentation. |
| Approach: | They propose a task that summarises patients' main problems from daily progress notes using input from the provider's progress notes during hospitalization. |
| Outcome: | The proposed model outperforms two state-of-the-art seq2seq transformer architectures in summarizing patients' main problems from daily progress notes in the medical information mart for Intensive Care (MIMIC)-III. |
Copied to clipboard
| Challenge: | Sanskrit word segmentation is challenging due to the issue of Sandhi . digitisation efforts have made the manuscripts available in the public domain . |
| Approach: | They propose a deep sequence to sequence model that takes only the sandhied string as input and predicts the unsandhized string. |
| Outcome: | The proposed model improves on the current state of the art by 16.79% . the system can be trained "overnight" and be used for production . |
Copied to clipboard
| Challenge: | Recent trend for dependency parsing is adopting neural networks due to their significant success in a wide range of applications. |
| Approach: | They propose a sequence to sequence (seq2seque) dependency parser that predicts the relative position of head for each word. |
| Outcome: | The proposed parser achieves 94.11% UAS on PTB and 88.78% UAS . |
Copied to clipboard
| Challenge: | a hybrid approach to lemmatization enhances the seq2seq neural model with additional lemmas extracted from an external lexicon or a rule-based system. |
| Approach: | They propose a hybrid approach that enhances a seq2seq neural model with additional lemmas extracted from an external lexicon or a rule-based system. |
| Outcome: | The proposed model achieves statistically significant improvements on 23 UD languages, compared to baseline models not utilizing additional lemma information. |
Copied to clipboard
| Challenge: | Existing approaches to learn dialogue state tracking and response generation are time-intensive and not transferable between domains. |
| Approach: | They propose a transfer learning framework that allows efficient dialogue state tracking with a minimal generation length. |
| Outcome: | The proposed framework improves the inference efficiency and improves state-of-the-art results on multi-domain multi-tasking systems. |
Copied to clipboard
| Challenge: | Semantic parsing aims to map a natural language sentence into a machine executable formal representation. |
| Approach: | They propose a structure-aware self-attention language model to capture structural information of target representations and propose incorporating it into a seq2seq model. |
| Outcome: | The proposed model improves the baseline model on four semantic parsing and Python code generation tasks. |
Copied to clipboard
| Challenge: | Existing unsupervised approaches for learning knowledge graphs require multiple modules and require entity information or relation type for training. |
| Approach: | They propose a method that uses a unified pretrained language model to achieve fully unsupervised graph-text mutual conversion for the first time. |
| Outcome: | The proposed method outperforms state-of-the-art methods for G2T and T2G tasks by fine-tuning only one pretrained model. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are well suited for seq2seq translation . a lack of pretraining corpora can hinder the use of LLMs for structured interpretation . |
| Approach: | They propose to decompose available ICE trees into fragments and use additional invocations to map them to corresponding utterances. |
| Outcome: | The proposed method shows visible gains on diverse parsing benchmarks on popular languages. |
Copied to clipboard
| Challenge: | Existing studies focus on Wikipedia-derived KBs, but there is little work on EL over Wikidata . EL systems have found applications in many tasks such as question answering . |
| Approach: | They propose a novel approach to linking entity mentions to referent entities in a knowledge base . they use a sequence-to-sequence model to generate the profile of the target entity . |
| Outcome: | The proposed approach achieves state-of-the-art results on three Wikidata-based datasets and strong performance on TACKBP-2010. |
Copied to clipboard
| Challenge: | a new method for Twitter user geolocation rewrites noisy, multilingual location strings into structured English location names. |
| Approach: | They propose a sequence-to-sequence (seq2sequ) model that rewrites noisy location strings into structured English location names. |
| Outcome: | The proposed model can generalize well to unseen temporal data, but performance does vary by language and country. |
Copied to clipboard
| Challenge: | GM-RKB WikiText Error Correction Task for automatic detection and correction of typographical errors in Wikitext annotated pages. |
| Approach: | They propose to use a GM-RKB semantic wiki to automatically detect typographical errors in WikiText annotated pages. |
| Outcome: | The included corpus is based on a snapshot of the GM-RKB domain-specific semantic wiki consisting of a large collection of concepts, personages, and publications . Numerous Wikipedia pages were also included as additional training data in the task’s evaluation process. |
Copied to clipboard
| Challenge: | Pre-trained sequence to sequence models are effective in making and generating NL explanations, but they have many shortcomings. |
| Approach: | They propose a model that uses sentence markers to eliminate explanation fabrication . they use fusion-in-decoder architecture to handle long input contexts . |
| Outcome: | The proposed model significantly improves on the ERASER explainability benchmark. |
Copied to clipboard
| Challenge: | Existing methods for audio-visual speech recognition use extra data to increase performance . a recent study shows that the use of unimodal self-supervised learning improves performance on multimodal tasks. |
| Approach: | They propose to use unimodal self-supervised learning to train AVSR models on unlabelled unilateral data. |
| Outcome: | The proposed model improves on lip reading sentences 2 by 30% even without an external language model. |
Copied to clipboard
| Challenge: | Existing methods for assessing the robustness of sequence-to-sequence models have been ignored by the literature. |
| Approach: | They propose an evaluation framework for adversarial attacks on seq2seq models that takes the semantic equivalence of the pre- and post-perturbation input into account. |
| Outcome: | The proposed framework breaks the assumption that source perturbations should not result in changes in the expected output, but allows for meaning-preserving perturbations that change the output sequence. |
Copied to clipboard
| Challenge: | Pre-trained models excel at graph semantic parsing with rich annotated data, but generalize poorly to out-of-distribution and long-tail examples. |
| Approach: | They propose a compositionality-aware approach to neural-symbolic inference informed by model confidence to capture different aspects of the graph prediction. |
| Outcome: | The proposed method outperforms state-of-the-art models on an English resource grammar parsing problem on standard in-domain and seven OOD corpora. |
Copied to clipboard
| Challenge: | Existing approaches to integrate source syntax into neural machine translations use linearized parses. |
| Approach: | They propose a linearized parsed neural machine translation technique that integrates source syntax into neural machine learning. |
| Outcome: | The proposed model improves over seq2seq and parsed baselines by over 1 BLEU on the WMT17 English-German task. |
Copied to clipboard
| Challenge: | Task-oriented parsing (TOP) aims to convert natural language into machine-readable representations of specific tasks, such as setting an alarm. |
| Approach: | They propose to reduce TOP to abstractive question answering by using canonical paraphrasing to generate linearized parse trees. |
| Outcome: | The proposed technique outperforms state-of-the-art methods in full-data settings while achieving dramatic improvements in few-shot settings. |
Copied to clipboard
| Challenge: | Entity recognition is a fundamental task in document image understandings. |
| Approach: | They propose to use label surface names to better inform a model of target entity type semantics and embed the labels into the spatial embedding space to capture spatial correspondence between regions and labels. |
| Outcome: | The proposed model can be built on a few shots of annotated document images . it can be used to better inform the model and capture spatial correspondence between regions . |
Copied to clipboard
| Challenge: | Recent work has leveraged natural language descriptions of schema elements to enable universal dialogue systems; however, descriptions only indirectly convey schema semantics. |
| Approach: | They propose to use schema-guided modeling to prompt seq2seq models with a labeled example dialogue to show schema semantics rather than tell them. |
| Outcome: | The proposed model outperforms models using short examples as schema representations on two popular dialogue state tracking benchmarks. |
Copied to clipboard
| Challenge: | Sequence-to-sequence models have been successful across many NLP tasks, but they have low generalization accuracy . |
| Approach: | They propose to use linguistic knowledge to overcome generalization limitations of seq2seq models . they show that human beings are able to understand and produce linguistic structures they have never observed before . |
| Outcome: | The proposed models can overcome this limitation by having linguistic knowledge built in. |
Copied to clipboard
| Challenge: | Recent studies have shown that simpler, properly tuned models are at least competitive across NLP tasks. |
| Approach: | They propose to use a table-to-text and neural question generation tasks to generate text from structured and unstructured data. |
| Outcome: | The proposed task generates biographies based on Wikipedia infoboxes . the proposed model can achieve the state of the art in both tasks . |
Copied to clipboard
| Challenge: | Popular neural architectures lack strong structural inductive biases for seq2seq NLP tasks . previous work shows that these models struggle with systematic generalization . |
| Approach: | They propose to inject a structural inductive bias into a seq2seq model by pre-training it to simulate structural transformations on synthetic data. |
| Outcome: | The proposed method improves few-shot learning and generalization of FST-like models. |
Copied to clipboard
| Challenge: | Existing methods for Aspect category sentiment analysis use pre-trained language models to learn aspect category-specific representations. |
| Approach: | They propose to make use of pre-trained language models by casting the ACSA tasks into natural language generation tasks, using natural language sentences to represent the output. |
| Outcome: | The proposed method gives the best reported results, having large advantages in few-shot and zero-shot settings. |
Copied to clipboard
| Challenge: | Existing models for machine translation and dialogue response generation require a large number of handcrafted features. |
| Approach: | They propose to interpret a general neural model comparatively by using the seq2seq model in two mainstream NLP tasks. |
| Outcome: | The proposed model is used in two mainstream NLP tasks and is compared with a standard model. |
Copied to clipboard
| Challenge: | Existing lexicons have limited coverage for learning morphological inflection patterns from labeled data. |
| Approach: | They propose two new methods to solve paradigm completion, the morphological task of generating missing forms, given a partial paradigm. |
| Outcome: | The proposed methods outperform the previous state-of-the-art by 9.71% absolute accuracy on a 52-language benchmark dataset. |
Copied to clipboard
| Challenge: | Existing systems that target hate speech with intent-conditioned counterspeech generate better results with longer contexts. |
| Approach: | They propose a framework that enables counterspeech generation by modeling the pragmatic implications underlying social biases in hateful statements. |
| Outcome: | The proposed framework outperforms existing benchmarks in intent-conditioned counterspeech generation. |
Copied to clipboard
| Challenge: | Recent deep neural network successes rekindled debates on their natural language processing abilities. |
| Approach: | They propose to test the ability of sequence-to-sequence networks to perform systematic, compositional generalization of linguistic rules. |
| Outcome: | The proposed dataset shows that convolutional networks perform better on compositional generalization tasks than RNNs. |
Copied to clipboard
| Challenge: | Code generation is the task of generating code snippets from input user specifications written in natural language (NL). |
| Approach: | They evaluate the significance of input parse trees for code generation by using constituency-based parsers as input and an abstract syntax tree as the target. |
| Outcome: | The proposed models on a Python-based code generation dataset and a semantic parsing dataset show that constituency trees encoded using a structure-aware model improve performance. |
Copied to clipboard
| Challenge: | Existing methods for reading order detection are too laborious to annotate large datasets. |
| Approach: | They propose to use a large-scale dataset to annotate reading order information for document images . they use XML metadata to capture the reading order of WORD documents . |
| Outcome: | The proposed model performs almost perfectly in reading order detection and improves both open-source and commercial OCR engines in ordering text lines in their results. |
Copied to clipboard
| Challenge: | A teaser is a short reading suggestion for an article that is illustrative and includes curiosity-arousing elements to entice potential readers to read particular news items. |
| Approach: | They propose a benchmark and baseline system for the process of generating teasers. |
| Outcome: | The proposed system is best performing with a pointer network. |
Copied to clipboard
| Challenge: | Existing work on lifelong learning requires incremental memory space to learn a model . existing work on experience replay or elastic weighted consolidation requires incremental space . |
| Approach: | They propose a framework that leverages a recall optimization mechanism to memorize parameters of previous tasks via regularization and a domain drift estimation algorithm to compensate the drift between different domains in the embedding space. |
| Outcome: | The proposed framework outperforms SOTA models on paraphrase and dialog response generation tasks. |
Copied to clipboard
| Challenge: | Paraphrase Identification (PI) is a fundamental natural language understanding task with non-trivial challenges. |
| Approach: | They propose a Generative Boosting Training approach for Paraphrase Identification (PI) they use a seq2seq model to perform DA on misclassified instances periodically . |
| Outcome: | The proposed method outperforms state-of-the-art PI models on English and Chinese PI tasks with good efficiency and effectiveness. |
Copied to clipboard
| Challenge: | Existing methods for seq2seq regularization use label smoothing, but it is difficult to extend it to other datasets. |
| Approach: | They propose a method that smooths over well formed relevant sequences that are semantically similar to the target sequence. |
| Outcome: | The proposed method shows a consistent and significant improvement over the state-of-the-art methods on different datasets. |
Copied to clipboard
| Challenge: | Qualitative assessments in the form of human judgements (question generation), attention visualization (MT), and sample output (summarization) provide further evidence of the ability of Scratchpad to generate fluent and expressive output. |
| Approach: | They propose to use the encoder as a "scratchpad" memory to keep track of what has been generated and guide future generation. |
| Outcome: | The proposed mechanism improves the fluency of seq2seq models on three well-studied natural language generation tasks. |
Copied to clipboard
| Challenge: | Keyphrase generation is a longstanding task in NLP with widespread applications. |
| Approach: | They propose a likelihood-based decode-select algorithm for seq2seq PLMs that improves greedy search by an average of 4.7% semantic F1 across five datasets. |
| Outcome: | The proposed algorithm improves greedy search by an average of 4.7% semantic F1 across five datasets. |
Copied to clipboard
| Challenge: | PoDA pre-trains encoders and decoders by denoising noise-corrupted text . Unlike encoder-only or decode-only methods, it can be used for text generation tasks without using any task-specific techniques. |
| Approach: | They propose a sequence-to-sequence (seq2sequ) pre-training method PoDA which denoises autoencoders by denoising noise-corrupted text. |
| Outcome: | The proposed method improves model performance over strong baselines without using any task-specific techniques and significantly speed up convergence. |
Copied to clipboard
| Challenge: | Existing models for text-to-text generation do not explicitly focus on important concepts in the input and output. |
| Approach: | They propose a framework to automatically extract, denoise, and enforce important input concepts as lexical constraints. |
| Outcome: | The proposed framework performs comparably or better than its unconstrained counterpart on automatic metrics and receives better ratings in the human evaluation. |
Copied to clipboard
| Challenge: | Currently, virtual assistants work in the paradigm of intent-slot tagging and the slot values are directly passed as-is to the execution engine. |
| Approach: | They propose to use BART to rephrase a query to make it more natural . they propose to add a copy-pointer and copy loss to it to improve performance . |
| Outcome: | The proposed model improves on existing models by adding a copy-pointer and copy loss. |
Copied to clipboard
| Challenge: | a recent study shows that inappropriate language can cause models to output profanity . authors propose a training framework to prevent such outputs from hurting the usability of models . |
| Approach: | proposed training framework eliminates the causes that trigger the generation of profanity . authors propose a framework that leverages a short list of profans to prevent this . |
| Outcome: | a proposed training framework can prevent models from generating profanity . the proposed framework leverages a short list of profanities examples . |
Copied to clipboard
| Challenge: | Existing methods for generating semantically diverse sentences are based on locality-sensitive hash (LSH)-based semantic sentence codes that explicitly capture meaningful semantic differences. |
| Approach: | They propose a method for generating semantically diverse sentences using neural sequence-to-sequence models by conditioned on locality-sensitive hash-based semantic sentence codes whose Hamming distances correlate with human judgments of semantic textual similarity. |
| Outcome: | The proposed method improves output diversity without degrading performance on causal generation tasks. |
Copied to clipboard
| Challenge: | Neural sequence-to-sequence models are autoregressive, meaning they factor the joint probability of the output sequence into the product of probabilities over the next to-ken. |
| Approach: | They propose a non-autoregressive sequence generation model using latent variables . they use generative flow to model complex distributions using neural networks . |
| Outcome: | The proposed model performs comparable to state-of-the-art models and has constant decoding time w.r.t the sequence length. |
Copied to clipboard
| Challenge: | Existing models for keyphrase generation only use labeled data, which is limited to resource-rich domains. |
| Approach: | They propose semi-supervised keyphrase generation methods by leveraging labeled data and large-scale unlabeled samples for learning. |
| Outcome: | The proposed methods outperform state-of-the-art models trained with labeled data and large-scale unlabeled samples for learning. |
Copied to clipboard
| Challenge: | Existing models for dialog generation are challenging to train using the standard Seq2Seq models. |
| Approach: | They propose a framework for Hierarchical Transformer Encoders that can be morphed into any hierarchical transformer by using specially designed attention masks and positional encodings. |
| Outcome: | The proposed framework can be morphed into any hierarchical encoder, including HRED and HIBERT like models, by using specially designed attention masks and positional encodings. |
Copied to clipboard
| Challenge: | Developing efficient and effective parsing solutions has always been a key focus in NLP. |
| Approach: | They propose a generic seq2seq parsing framework that casts constituency parsers into a series of conditional splitting decisions. |
| Outcome: | The proposed framework outperforms state-of-the-art (SoTA) methods in discourse parsing . it is based on a syntactic and discourse parsed model and is linear in number of nodes . |
Copied to clipboard
| Challenge: | Existing work on state tracking assumes both entities and state space are known, which limits their applicability. |
| Approach: | They propose a two-stage model that refines the state change prediction conditioned on entities predicted from the first stage. |
| Outcome: | The proposed model improves on the cleaned dataset and the evaluation metric on the proposed model. |
Copied to clipboard
| Challenge: | a lack of high quality conversational data is limiting progress in dialog systems . we present a dataset of 13,215 task-based dialogs . |
| Approach: | They propose a task-based dialog dataset which includes 13,215 task-related dialogs . they use a two-person, spoken "Wizard of Oz" approach and a "self-dialog" approach . |
| Outcome: | The taskmaster-1 dataset contains 13,215 task-based dialogs comprising six domains. |
Copied to clipboard
| Challenge: | Ellipsis and co-reference are common and ubiquitous especially in multi-turn dialogues. |
| Approach: | They propose a unified end-to-end Generative Ellipsis and CO-reference Resolution model . the model can generate a new pragmatically complete user utterance by alternating the generation and copy mode for each user . |
| Outcome: | The proposed model can generate a new pragmatically complete user utterance by alternating the generation and copy mode for each user . intrinsic evaluations on the resolution of ellipsis and co-reference show that the model outperforms the baseline model in terms of EM, BLEU and F1 . |
Copied to clipboard
| Challenge: | Sequence-to-Sequence models favor short generic responses . however, the model is not suitable for modeling dialogues . |
| Approach: | They propose a model that connects preceding and following conversations to a prior distribution to avoid non-differentiability of discrete natural language tokens. |
| Outcome: | The proposed model is highly efficient in learning the backbone of human-computer communications, but favors short generic responses. |
Copied to clipboard
| Challenge: | Existing studies show that dependency information is used only for encoder-only-based relation extraction tasks. |
| Approach: | They propose a syntax-aware seq2seq pre-trained model for relation extraction that incorporates dependency information into a seq2-trained language model by continual pre-training with a dependency parsing task. |
| Outcome: | The proposed model incorporates dependency information into a seq2seq pre-trained language model by continual pre-training with a generative sequence-to-sequence (sequ2sq)-based dependency parsing task. |
Copied to clipboard
| Challenge: | Currently, document summarization is challenging even for humans. |
| Approach: | They propose a focus attention mechanism which encourages decoders to generate tokens that are topically similar to the input document. |
| Outcome: | The proposed method outperforms top-k and nucleus sampling methods on the BBC extreme summarization task and is more accurate than focus attention-based models. |
Copied to clipboard
| Challenge: | Existing text style transfer methods face three challenges: 1) the transfer is weakly interpretable; 2) generated outputs struggle in content preservation; 3) the trade-off between content and style is intractable. |
| Approach: | They propose a hierarchical reinforced sequence operation method that proposes operation positions and alters the sentence. |
| Outcome: | The proposed method significantly outperforms existing methods on two text style transfer datasets. |
Copied to clipboard
| Challenge: | Existing approaches to AMR focus on one-side improvements despite the duality of the two tasks . instead, we propose data-efficient Bidirectional Bayesian learning (BiBL) to facilitate bidirectional information transition. |
| Approach: | They propose a data-efficient bidirectional Bayesian learning approach to facilitate bidirectional information transition by adopting a single-stage multitasking strategy. |
| Outcome: | The proposed model outperforms existing models on benchmark datasets without extra training data. |
Copied to clipboard
| Challenge: | Existing text generation methods use autoregressive (AR) methods, which generate tokens one by one, but are time-consuming. |
| Approach: | They propose an efficient model FMSeq which utilizes flow matching to straighten the generation path, thereby enabling fast sampling for diffusion-based seq2seq text generation. |
| Outcome: | The proposed model generates comparable quality to the SOTA diffusion-based DiffuSeq in just 10 steps, achieving a 200-fold speedup. |
Copied to clipboard
| Challenge: | Abstractive summarization is the process of generating a condensed version of a given conversation while preserving the most salient aspects. |
| Approach: | They propose to use a dataset to analyze code-switched conversations in Hindi and English to summarize them. |
| Outcome: | The proposed dataset contains over 6,800 code-switched conversations and their corresponding human-annotated summaries in English (En) and Hi-En. |
Copied to clipboard
| Challenge: | In argumentation theory, an enthymeme is defined as incomplete argument found in discourse . encoding discourse-aware commonsense improves the quality of the generated implicit premises . |
| Approach: | They propose a task that generates an implicit premise in an enthymeme using commonsense . they use a narrative text dataset to analyze the quality of the generated premises . |
| Outcome: | The proposed model outperforms baseline models on three datasets. |
Copied to clipboard
| Challenge: | Existing approaches to improve reasoning capability of large language models rely on accessibility or require significantly increased train- and inference-time costs. |
| Approach: | They propose a method to improve QA reasoning of large language models in a black-box setting by using a trained adaptation model to perform a seq2seq mapping from the often-imperfect reasonings of the original LLM to the correct or improved reasonings. |
| Outcome: | The proposed approach significantly improves reasoning accuracy across various QA benchmarks compared to the best-performing adaptation baselines. |
Copied to clipboard
| Challenge: | Recent advances in abstractive summarization have been fueled by the advent of large-scale Transformers pre-trained on autoregressive language modeling objectives. |
| Approach: | They analyze summarization decoders in both blackbox and whitebox ways by studying on the entropy, or uncertainty, of the model’s token-level predictions. |
| Outcome: | The proposed model generates tokens in a free-form manner, but this flexibility makes it difficult to interpret their behavior. |
Copied to clipboard
| Challenge: | Existing work on adding syntactic information to NMT systems is limited to linguistically-inspired tree structures. |
| Approach: | They propose an NMT model that can naturally generate the topology of an arbitrary tree structure on the target side. |
| Outcome: | The proposed model outperforms standard seq2seq models by 2.1 BLEU points and other methods for incorporating target-side syntax by 0.7 BLUE points. |
Copied to clipboard
| Challenge: | Neural sequence-to-sequence models provide a powerful framework for learning to translate source texts into target texts. |
| Approach: | They propose a sequence tagging approach that casts text generation as a text editing task. |
| Outcome: | The proposed model outperforms strong seq2seq models on sentence fusion, sentence splitting, abstractive summarization, and grammar correction tasks and achieves state-of-the-art performance. |
Copied to clipboard
| Challenge: | Recent work has focused on natural logic, which operates directly on natural language by capturing the semantic relation of spans between an aligned claim and its evidence via set-theoretic operators. |
| Approach: | They propose to use question answering to predict natural logic operators using generalization capabilities of instruction-tuned language models. |
| Outcome: | The proposed approach outperforms the best baseline on a Danish verification dataset by 4.3 accuracy points. |
Copied to clipboard
| Challenge: | Existing models for data-to-text generation are based on pipelines and end-to end architectures. |
| Approach: | They use multidimensional quality metrics to evaluate models on end-to-end data-totext generation and compare their performance against pipeline models. |
| Outcome: | The proposed model improves in Omission and Inaccuracy Extrinsic errors but increases errors such as Addition. |
Copied to clipboard
| Challenge: | Personifications are figures of speech that endow inanimate entities with properties and actions typically seen as requiring animacy. |
| Approach: | They propose to use personification data to train a parallel corpus of personifications . they propose to combine personification-related literalizations with automatic ones . |
| Outcome: | The proposed personification system can generate diverse and creative personifications . it can generate personification-related qualities such as interestingness and animacy . |
Copied to clipboard
| Challenge: | Recent studies on AMR-to-text generation formalize the task as a sequence-tosequence learning problem . previous approaches only consider the relations between directly connected concepts while ignoring the rich structure in AMR graphs. |
| Approach: | They propose a structure-aware self-attention approach to model the relations between indirectly connected concepts in the seq2seq model. |
| Outcome: | The proposed approach outperforms the state-of-the-art on English AMR benchmarks . it significantly outperformed the state of the art on the benchmarks, with 29.66 and 31.82 BLEU scores . |
Copied to clipboard
| Challenge: | Seq2edit models decode only once without aware of subsequent tokens. |
| Approach: | They propose to iteratively refine the correction results of seq2seq models via Multi-Pass Decoding (MPD) to improve performance, but MPD increases inference costs . they propose to merge the source input and previous round correction result into one sequence. |
| Outcome: | Experiments on the CoNLL-14 and BEA-19 test set show that the proposed approach improves over baselines. |
Copied to clipboard
| Challenge: | a neural transducer that incorporates hierarchical phrases as a source of inductive bias during training and as explicit constraints during inference is described. |
| Approach: | They propose a neural transducer that incorporates hierarchical phrases as a source of inductive bias during training and as explicit constraints during inference. |
| Outcome: | The proposed model performs well on small scale machine translation benchmarks. |
Copied to clipboard
| Challenge: | Existing methods to improve the efficiency of GEC are not efficient enough for GEC. |
| Approach: | They propose a language-independent approach to improve the efficiency of GEC by dividing the task into two subtasks: ESD and ESC. |
| Outcome: | The proposed approach performs comparably to conventional seq2seq approaches in English and Chinese GEC benchmarks with less than 50% time cost for inference. |
Copied to clipboard
| Challenge: | Existing models that generate keyphrases without human-labeled data are lacking in this area. |
| Approach: | They propose a model that consists of two modules that can be built in an unsupervised fashion and can perform consistently across domains. |
| Outcome: | The proposed model performs consistently across domains and narrows the gap between supervised and unsupervised models down to about 16%. |
Copied to clipboard
| Challenge: | a release note is a technical document that describes the latest changes to a software product. |
| Approach: | They propose to extract and then abstract release notes from GitHub repositories using a transformer-based network like BART. |
| Outcome: | The proposed methods generate less noisy release notes at higher coverage than baselines. |
Copied to clipboard
| Challenge: | Pre-trained encoder-only and sequence-to-sequence models are computationally expensive. |
| Approach: | They propose a recipe to initialize one model from the other to improve pre-training efficiency. |
| Outcome: | The proposed method matches the performance of a from-scratch model with a multilingual encoder while reducing the total compute cost by 27%. |
Copied to clipboard
| Challenge: | Sequence-to-sequence (seq2sequ) models have a weakness: they cannot always generate sentences without grammatical errors. |
| Approach: | They propose to use automatic grammatical error correction to improve seq2seq models . they conduct experiments on machine translation, formality style transfer, sentence compression and simplification . |
| Outcome: | The proposed system can improve grammaticality of generated text and improve formal style tasks. |
Copied to clipboard
| Challenge: | Existing neural QG models generate generic questions that are not relevant to passages and answers. |
| Approach: | They propose to prioritize words that are morphologically close to words in the passage when generating questions. |
| Outcome: | The proposed methods improve relevance of generated questions to passages and answers. |
Copied to clipboard
| Challenge: | Existing work suffers from mismatching between question type and answer . existing work fails to generate questions with type how while answer is personal name . |
| Approach: | They propose to automatically predict the question type based on the input answer and context. |
| Outcome: | The proposed model improves on both SQuAD and MARCO datasets and improves accuracy on the input answer and context. |
Copied to clipboard
| Challenge: | Neural network-based sequence-to-sequence models suffer from low diversity in open-domain dialogue generation. |
| Approach: | They propose a way to diversify dialogue generation by leveraging non-conversational text . they collect large-scale corpus from forum comments, idioms and book snippets . |
| Outcome: | The proposed model produces significantly more diverse responses without sacrificing relevance with context. |
Copied to clipboard
| Challenge: | Existing methods to induce Chain-of-Thought (CoT) in LLMs are limited and do not consider the importance of efficiently utilizing existing CoT data. |
| Approach: | They propose a new training paradigm which exploits the inherent information in CoT for iterative generation. |
| Outcome: | The proposed training paradigm surpasses direct seq2seq training on CoT-extensive tasks without data augmentation or altering the model itself. |
Copied to clipboard
| Challenge: | Inductive biases play a critical role in NLP, especially in learning from limited data and generalizing systematically outside of the training distribution. |
| Approach: | They propose to strengthen the structural inductive bias of a Transformer by intermediate pre-training to perform syntactic transformations of dependency trees given a description of the transformation. |
| Outcome: | The proposed model can perform syntactic transformations and generalize semantic parsing with attention heads that keep track of which syntaktic transformation needs to be applied to which token. |
Copied to clipboard
| Challenge: | Existing work adopts data augmentation techniques to generate pseudo-annotated sentences . existing methods neither preserve semantic consistency of original sentences nor preserve syntax structure of sentences when expressing relations using seq2seq models, resulting in less diverse augmentations. |
| Approach: | They propose a dedicated augmentation technique for relational texts, named GDA, which uses two complementary modules to preserve both semantic consistency and syntax structures. |
| Outcome: | The proposed technique can bring 2.0% F1 improvements in three datasets under low-resource setting. |
Copied to clipboard
| Challenge: | Existing work on coreference resolution suggests task-specific models are necessary . a recent line of work that take an alternative approach leveraging advances in seq2seq-based models is needed . |
| Approach: | They propose a pretrained seq2seq transformer to map an input document to a tagged sequence encoding the coreference annotation. |
| Outcome: | The proposed model outperforms or matches the best coreference systems on an array of datasets. |
Copied to clipboard
| Challenge: | Text simplification systems are based on the quality and quantity of complex-simple sentence pairs extracted by aligning sentences between parallel articles. |
| Approach: | They propose a neural CRF alignment model which leverages the sequential nature of sentences in parallel documents and utilizes a sentence pair model to capture semantic similarity. |
| Outcome: | The proposed model outperforms previous work on monolingual sentence alignment task by more than 5 points in F1. |
Copied to clipboard
| Challenge: | Inductive transfer learning has taken the entire NLU field by storm, with models such as BERT and BART setting new state-of-the-art on countless tasks. |
| Approach: | They introduce a large-scale pretrained seq2seq model for French that is very competitive with state-of-the-art BERT-based French language models such as CamemBERT and FlauBERT. |
| Outcome: | The proposed model outperforms existing models on discriminative and generative tasks on a French summarization dataset. |
Copied to clipboard
| Challenge: | Extensive experiments show EdgeFormer can effectively outperform previous parameter-efficient Transformer baselines and achieve competitive results under both the computation and memory constraints. |
| Approach: | They propose a parameter-efficient Transformer for on-device seq2seq generation that uses two novel principles for cost-effective parameterization. |
| Outcome: | Extensive experiments show that EdgeFormer outperforms the previous parameter-efficient Transformers and achieves competitive results under both the computation and memory constraints. |
Copied to clipboard
| Challenge: | Existing methods for generating explanatory notes for language learners are inadequate . nagata et al. demonstrates that neural-retrieval-based methods can generate feedback comments for preposition use . |
| Approach: | They investigate three different methods for generating feedback comments for preposition use . grammatical and writing items can also be used to generate feedback comments . |
| Outcome: | The proposed methods outperform neural-retrieval-based methods in generating feedback comments for preposition use. |
Copied to clipboard
| Challenge: | Recent datasets expose the lack of systematic generalization ability in standard sequence-to-sequence models. |
| Approach: | They propose two techniques to address the lack of systematic generalization ability in standard sequence-to-sequence models by mutual exclusivity training and prim2primX data augmentation. |
| Outcome: | The proposed methods improve on two widely-used compositionality datasets. |
Copied to clipboard
| Challenge: | Seq2seq models struggle with compositional generalization in semantic parsing, i.e. generalizing to unseen compositions or deeper recursion of phenomena that the model handles correctly in isolation. |
| Approach: | They propose a new way of parameterizing and predicting permutations by combining input tokens with multisets of output tokens and a method to backpropagate through the solver. |
| Outcome: | The proposed model outperforms pretrained models and prior work on realistic semantic parsing tasks that require generalization to longer examples. |
Copied to clipboard
| Challenge: | lexical substitution tasks require a system to provide adequate replacements for a word in a given context. |
| Approach: | They propose a generative approach to lexical substitution using a seq2seq model to generate suitable replacements for a word in context. |
| Outcome: | The proposed approach achieves state-of-the-art on different benchmarks and human evaluation of the generated substitutes. |
Copied to clipboard
| Challenge: | Recent studies on AMR parsing often regard this task as a seq2seq translation problem. |
| Approach: | They propose to translate AMR graphs into AMR token sequences in pre-processing and recover AMR from sequences after decoding. |
| Outcome: | The proposed approach outperforms baseline and achieves 85.5 0.1 and 84.2 0.2 Smatch scores on AMR 2.0 and AMR 3.0. |
Copied to clipboard
| Challenge: | Current text simplification research mostly focuses on English and on sentencelevel simplification. |
| Approach: | They propose to use a dataset of parallel, professionally written and manually aligned simplifications in plain German "plain DE" and "Einfache Sprache" they build a web harvester and experiment with automatic alignment methods to facilitate integration of non-aligned and to be-published parallel documents. |
| Outcome: | The proposed dataset of parallel, professionally written and manually aligned simplifications in plain German is extended to 750 document pairs and 3.5k sentence pairs. |
Copied to clipboard
| Challenge: | Multi-component compounding is a prevalent phenomenon in Sanskrit, and understanding the implicit structure of a compound is crucial for deciphering its meaning. |
| Approach: | They propose a task to identify nested spans of a multi-component compound and decode the implicit semantic relations between them. |
| Outcome: | The proposed framework surpasses the best baseline framework with an average improvement of 13.1 points in terms of Labeled Span Score and 5-fold enhancement in inference efficiency. |
Copied to clipboard
| Challenge: | CASENT predicts ultra-fine entities mentioned in text into types with calibrated confidence scores. |
| Approach: | They propose a model that predicts ultra-fine entities with calibrated confidence scores for entity typing. |
| Outcome: | The proposed model outperforms existing models in terms of F1 score and calibration error while achieving 50 times faster inference speed. |
Copied to clipboard
| Challenge: | Inflection is a process of word formation in which a base word form (lemma) is modified to express grammatical categories. |
| Approach: | They develop a retrograde model and two sequence-to-sequence models based on LSTM and Transformer. |
| Outcome: | The proposed systems outperform the existing systems on 9 out of 16 languages in the OOV evaluation. |
Copied to clipboard
| Challenge: | Existing compositional semantic parsers for DRT struggle to produce well-formed representations due to the complexity of the sentence. |
| Approach: | They propose a compositional, neurosymbolic semantic parser for DRT that uses a novel mechanism for predicting quantifier scope. |
| Outcome: | The proposed model produces well-formed outputs and performs well on complex sentences. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are susceptible to generating harmful content when prompted with carefully crafted inputs, a vulnerability known as LLM jailbreaking. |
| Approach: | They propose an end-to-end generative approach for jailbreak rewriting inspired by diffusion models that uses a sequence-tosequence (seq2sequ) diffusion model as a generator, conditioning on the original prompt and guiding the denoising process with a novel attack loss. |
| Outcome: | Experiments on Advbench and Harmbench show that the proposed method outperforms autoregressive jailbreak models across evaluation metrics including ASR, fluency, diversity and diversity. |
Copied to clipboard
| Challenge: | Existing models generate morpheme-level glosses but assign them to whole words without predicting the actual morphological boundaries, making them less interpretable and therefore untrustworthy to human annotators. |
| Approach: | They propose to use neural networks to predict interlinear glosses and morphological segmentation from raw text. |
| Outcome: | The proposed model outperforms GlossLM on glossing and beats open-source models on segmentation, glossing, and alignment. |
Copied to clipboard
| Challenge: | Hawaiian orthography employs two distinct spelling systems, both of which are used by communities of speakers today. |
| Approach: | They develop models that convert between the ‘okina letter and kahak diacritic, which represent glottal stops and long vowels, respectively. |
| Outcome: | The proposed models outperform neural seq2seq models and LLMs in a low-resource setting, highlighting the potential for traditional machine learning approaches in . low-cost environments. |