SOTAVerified

MUSS: Multilingual Unsupervised Sentence Simplification by Mining Paraphrases

2020-05-01LREC 2022Code Available1· sign in to hype

Louis Martin, Angela Fan, Éric de la Clergerie, Antoine Bordes, Benoît Sagot

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Progress in sentence simplification has been hindered by a lack of labeled parallel simplification data, particularly in languages other than English. We introduce MUSS, a Multilingual Unsupervised Sentence Simplification system that does not require labeled simplification data. MUSS uses a novel approach to sentence simplification that trains strong models using sentence-level paraphrase data instead of proper simplification data. These models leverage unsupervised pretraining and controllable generation mechanisms to flexibly adjust attributes such as length and lexical complexity at inference time. We further present a method to mine such paraphrase data in any language from Common Crawl using semantic sentence embeddings, thus removing the need for labeled data. We evaluate our approach on English, French, and Spanish simplification benchmarks and closely match or outperform the previous best supervised results, despite not using any labeled simplification data. We push the state of the art further by incorporating labeled simplification data.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
ASSETMUSS (BART+ACCESS Supervised)BLEU72.98Unverified
ASSETMUSS (BART+ACCESS Unsupervised)SARI (EASSE>=0.2.1)42.65Unverified
TurkCorpusMUSS (BART+ACCESS Supervised)SARI (EASSE>=0.2.1)42.53Unverified
TurkCorpusMUSS (BART+ACCESS Unsupervised)SARI (EASSE>=0.2.1)40.85Unverified

Reproductions