SOTAVerified

Unsupervised Neural Text Simplification

2018-10-18ACL 2019Code Available0· sign in to hype

Sai Surya, Abhijit Mishra, Anirban Laha, Parag Jain, Karthik Sankaranarayanan

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

The paper presents a first attempt towards unsupervised neural text simplification that relies only on unlabeled text corpora. The core framework is composed of a shared encoder and a pair of attentional-decoders and gains knowledge of simplification through discrimination based-losses and denoising. The framework is trained using unlabeled text collected from en-Wikipedia dump. Our analysis (both quantitative and qualitative involving human evaluators) on a public test data shows that the proposed model can perform text-simplification at both lexical and syntactic levels, competitive to existing supervised methods. Addition of a few labelled pairs also improves the performance further.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
ASSETUNTS (Unsupervised)SARI (EASSE>=0.2.1)35.19Unverified
TurkCorpusUNMT (Unsupervised)SARI (EASSE>=0.2.1)37.2Unverified
TurkCorpusUNTS-10k (Weakly supervised)SARI (EASSE>=0.2.1)37.15Unverified
TurkCorpusUNTS (Unsupervised)SARI (EASSE>=0.2.1)36.29Unverified

Reproductions