Controllable Sentence Simplification

10/07/2019
by   Louis Martin, et al.
0

Text simplification aims at making a text easier to read and understand by simplifying grammar and structure while keeping the underlying information identical. It is often considered an all-purpose generic task where the same simplification is suitable for all; however multiple audiences can benefit from simplified text in different ways. We adapt a discrete parametrization mechanism that provides explicit control on simplification systems based on Sequence-to-Sequence models. As a result, users can condition the simplifications returned by a model on parameters such as length, amount of paraphrasing, lexical complexity and syntactic complexity. We also show that carefully chosen values of these parameters allow out-of-the-box Sequence-to-Sequence models to outperform their standard counterparts on simplification benchmarks. Our model, which we call ACCESS (as shorthand for AudienCe-CEntric Sentence Simplification), increases the state of the art to 41.87 SARI on the WikiLarge test set, a +1.42 gain over previously reported scores.

READ FULL TEXT

page 6

page 9

research
10/10/2019

Controllable Sentence Simplification: Employing Syntactic and Lexical Constraints

Sentence simplification aims to make sentences easier to read and unders...
research
04/04/2019

Complexity-Weighted Loss and Diverse Reranking for Sentence Simplification

Sentence simplification is the task of rewriting texts so they are easie...
research
10/21/2020

Controllable Text Simplification with Explicit Paraphrasing

Text Simplification improves the readability of sentences through severa...
research
12/19/2022

(Psycho-)Linguistic Features Meet Transformer Models for Improved Explainable and Controllable Text Simplification

State-of-the-art text simplification (TS) systems adopt end-to-end neura...
research
10/20/2021

Discontinuous Grammar as a Foreign Language

In order to achieve deep natural language understanding, syntactic const...
research
07/01/2013

Syntactic sensitive complexity for symbol-free sequence

This work uses the L-system to construct a tree structure for the text s...

Please sign up or login with your details

Forgot password? Click here to reset