Challenge: Current sentence simplification systems are variants of sequence-to-sequence models adopted from machine translation.
Approach: They propose a sentence simplification model that learns explicit edit operations via a neural programmer-interpreter approach.
Outcome: The proposed model outperforms state-of-the-art models on three benchmark text simplification corpora in terms of SARI (+0.95 WikiLarge, +1.89 WikiSmall, -1.41 Newsela)

Similar Papers

Sentence Simplification with Memory-Augmented Neural Networks (N18-2)

Copied to clipboard

Challenge: Sentence simplification aims to simplify the content and structure of complex sentences . prior work has focused on monolingual machine translation (MT) and tree-based MT (TBMT).
Approach: They adapt an architecture with augmented memory capacities called Neural Semantic Encoders for sentence simplification.
Outcome: The proposed architecture improves on different datasets and improves human judgments.
A Detailed Evaluation of Neural Sequence-to-Sequence Models for In-domain and Cross-domain Text Simplification (L18-1)

Copied to clipboard

Challenge: Xu et al., 2016) show that a simple neural architecture can be efficiently used for in-domain and cross-domain text simplification.
Approach: They evaluate neural sequence-to-sequence models for text simplification on Wikipedia and Newsela datasets.
Outcome: The proposed model can generalize across corpora and overcome challenges when tested on Wikipedia and Newsela datasets.
Edit-Constrained Decoding for Sentence Simplification (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing studies have shown that lexically constrained decoding is effective for sentence simplification, but their constraints can be loose and may lead to sub-optimal generation.
Approach: They propose an edit operation based on lexically constrained decoding for sentence simplification using a dictionary of technical terms as constraints.
Outcome: The proposed method outperforms previous studies on English simplification corpora and is based on lexical paraphrasing.
Controlling Pre-trained Language Models for Grade-Specific Text Simplification (2023.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to text simplification control output complexity at corpus level disregarding complexity of individual inputs and considering only one level of output complexity.
Approach: They propose a method that predicts edit operations required for a specific grade level . they say this approach improves the quality of the simplified outputs over corpus-level heuristics .
Outcome: The proposed method improves the readability of simplified outputs over corpus-level search-based heuristics.
Simple and Effective Text Simplification Using Semantic and Neural Methods (P18-1)

Copied to clipboard

Challenge: Sentence splitting is a major simplification operation.
Approach: They propose a simple and efficient splitting algorithm based on an automatic semantic parser.
Outcome: The proposed method compares favorably to the state-of-the-art in combined lexical and structural simplification.
CombiNMT: An Exploration into Neural Text Simplification Models (2020.lrec-1)

Copied to clipboard

Challenge: Neural Text Simplification (NMT) is a widely used technique in Machine Translation (NLP)
Approach: They present a replication study of Exploring Neural Text Simplification Models using OpenNMT and Newsela datasets.
Outcome: The proposed systems improve on the original paper by using an updated implementation of OpenNMT and the newsela corpus alongside the original Wikipedia dataset.
Iterative Edit-Based Unsupervised Sentence Simplification (2020.acl-main)

Copied to clipboard

Challenge: Sentence simplification is relevant in various real-world and downstream applications.
Approach: They propose an edit-based approach to unsupervised sentence simplification that uses a scoring function to score fluency, simplicity, and meaning preservation to perform edits.
Outcome: The proposed model is more controllable and interpretable than state-of-the-art models on newsela and WikiLarge datasets.
GRS: Combining Generation and Revision in Unsupervised Sentence Simplification (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods for sentence simplification are supervised or unsupervised . paraphrasing captures complex edit operations, while revision-based methods provide more control and interpretability.
Approach: They propose an unsupervised approach to sentence simplification that combines text generation and text revision.
Outcome: The proposed method improves on the Newsela and ASSET datasets.
Controllable Text Simplification with Explicit Paraphrasing (2021.naacl-main)

Copied to clipboard

Challenge: Existing text simplification systems rely on deletion and do not paraphrase well.
Approach: They propose a hybrid approach that leverages linguistically-motivated rules for splitting and deletion and couples them with a neural paraphrasing model to produce varied rewriting styles.
Outcome: The proposed model improves paraphrasing capability and paraphrases more often than existing models.
Controllable Sentence Simplification (2020.lrec-1)

Copied to clipboard

Challenge: Text simplification is often considered an all-purpose generic task where the same simplifications are suitable for all but multiple audiences can benefit from simplified text in different ways.
Approach: They propose a controllable simplification model that provides explicit control on simplification systems based on Sequence-to-Sequence models.
Outcome: The proposed model outperforms standard models on simplification benchmarks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations