Polysemy as a Complexity Predictor in school textbooks.
DeSE(2023)
摘要
This article presents an algorithm for assessing text readability based on the analysis of polysemous words. The algorithm was tested on 30 Russian language textbooks for different grade levels, with the total size of the corpus of 1,097,170 words. We estimated values of two complexity predictors, i.e. the number of polysemous words (p1) and number of unique word senses (p2). The research demonstrated a high positive correlation between the respective parameters and text grade levels. The proposed algorithm has a potential to be applied in numerous fields that require text readability assessment and include education, law, medicine and business. The research prospects include validating the algorithm in other languages and text types, as well as contrast it with other text readability assessment algorithms.
更多查看译文
关键词
text readability assessment,polysemous words,Russian language textbooks,correlation analysis,Spearman’s coefficient,educational goals,text readability,NLTK,RuWordNet,text analysis,linguistics,computer science
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要