SOTAVerified

Unsupervised Sentence Simplification via Dependency Parsing

2022-06-10Code Available0· sign in to hype

Vy Vo, Weiqing Wang, Wray Buntine

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Text simplification is the task of rewriting a text so that it is readable and easily understood. In this paper, we propose a simple yet novel unsupervised sentence simplification system that harnesses parsing structures together with sentence embeddings to produce linguistically effective simplifications. This means our model is capable of introducing substantial modifications to simplify a sentence while maintaining its original semantics and adequate fluency. We establish the unsupervised state-of-the-art at 39.13 SARI on TurkCorpus set and perform competitively against supervised baselines on various quality metrics. Furthermore, we demonstrate our framework's extensibility to other languages via a proof-of-concept on Vietnamese data. Code for reproduction is published at https://github.com/isVy08/USDP.

Tasks

Reproductions