{'fraction_non_alphanumeric': 0.01737619461337967, 'fraction_numerical': 0.0017376194613379669, 'mean_word_length': 5.329670329670329, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Rating Ease of Readability using Transformers

Understanding and rating text complexity accurately can have a considerable impact on learning and education. In the past few decades, educators used traditional readability formulas to match texts with the readability level of students. This tends to oversimplify the different dimensions of text difficulty. Presently, transformer-based-language models have brought field of Natural Language Processing to a new era by understanding the text in a better way and achieving great success on many tasks. In this study, we assess the effectiveness of different pre-trained transformers on rating ease of readability. We propose a model built on top of the pre-trained Roberta transformer with weighted pooling, which uses multiple hidden states information effectively to do this task more accurately. Our experiments are done on a Dataset of English excerpts annotated by language experts which is extracted from Kaggle. On this Dataset, Our proposed model achieved 71% improvement over the traditional Flesch formula and a significant boost over other Transformer models and Long Short Term Memory(LSTM).