Explainable prediction of text complexity: The missing preliminaries for text simplification

14Citations
Citations of this article
75Readers
Mendeley users who have this article in their library.

Abstract

Text simplification reduces the language complexity of professional content for accessibility purposes. End-to-end neural network models have been widely adopted to directly generate the simplified version of input text, usually functioning as a blackbox. We show that text simplification can be decomposed into a compact pipeline of tasks to ensure the transparency and explainability of the process. The first two steps in this pipeline are often neglected: 1) to predict whether a given piece of text needs to be simplified, and 2) if yes, to identify complex parts of the text. The two tasks can be solved separately using either lexical or deep learning methods, or solved jointly. Simply applying explainable complexity prediction as a preliminary step, the out-of-sample text simplification performance of the state-of-the-art, black-box simplification models can be improved by a large margin.

Cite

CITATION STYLE

APA

Gârbacea, C., Guo, M., Carton, S., & Mei, Q. (2021). Explainable prediction of text complexity: The missing preliminaries for text simplification. In ACL-IJCNLP 2021 - 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Proceedings of the Conference (pp. 1086–1097). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2021.acl-long.88

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free