Text Simplification to Specific Readability Levels

Author:

Alkaldi Wejdan1ORCID,Inkpen Diana2ORCID

Affiliation:

1. Department of Information Technology, College of Computer and Information Sciences, King Saud University, Riyadh 11451, Saudi Arabia

2. School of Electrical Engineering and Computer Science, University of Ottawa, 800 King Edward, Ottawa, ON K1N 6N5, Canada

Abstract

The ability to read a document depends on the reader’s skills and the text’s readability level. In this paper, we propose a system that uses deep learning techniques to simplify texts in order to match a reader’s level. We use a novel approach with a reinforcement learning loop that contains a readability classifier. The classifier’s output is used to decide if more simplification is needed, until the desired readability level is reached. The simplification models are trained on data annotated with readability levels from the Newsela corpus. Our simplification models perform at sentence level, to simplify each sentence to meet the specified readability level. We use a version of the Newsela corpus aligned at the sentence level. We also produce an augmented dataset by automatically annotating more pairs of sentences using a readability-level classifier. Our text simplification models achieve better performance than state-of-the-art techniques for this task.

Funder

Research Center of College of Computer and Information Sciences, Deanship of Scientific Research in King Saud University

Natural Science and Engineering Research Council of Canada

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference44 articles.

1. Newsela Inc (2020, May 01). Newsela Dataset. Available online: http://newsela.com/data/.

2. Wubben, S., Van Den Bosch, A., and Krahmer, E. (2012, January 8–14). Sentence simplification by monolingual machine translation. Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Jeju Island, Republic of Korea.

3. Narayan, S., and Gardent, C. (2014, January 23–24). Hybrid simplification using deep semantics and machine translation. Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics, Baltimore, MD, USA.

4. Takahashi, T., Iwakura, T., Iida, R., Fujita, A., and Inui, K. (2001, January 27–30). KURA: A transfer-based lexico-structural para-phrasing engine. Proceedings of the 6th Natural Language Processing Pacific Rim Symposium (NLPRS 2001) Workshop on Automatic Paraphrasing: Theories and Applications, Tokyo, Japan.

5. Inui, K., Fujita, A., Takahashi, T., Iida, R., and Iwakura, T. (2003, January 11). Text Simplification for Reading Assistance: A Project Note. Proceedings of the Second International Workshop on Paraphrasing-Volume 16, Sapporo, Japan. PARAPHRASE ’03.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3