|
Zapiski Nauchnykh Seminarov POMI, 2023, Volume 529, Pages 140–156
(Mi znsl7424)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Readability formulas for three levels of Russian school textbooks
V. Solovyeva, V. Ivanovb, M. Solnyshkinaa a Kazan Federal University
b Innopolis University
Abstract:
In this work, we propose a new text complexity formula aimed at assessing the complexity of Russian school textbooks. We used the annotated Russian Academic Corpus containing over 5 million tokens as the training and validation data and employed machine learning methods in the study. The values of 4 parameters in each of the 154 texts used for the research were measured with the help of the tools from the Spacy library. Comparative analysis of the new and existing complexity formulas suggests that the differences between them are indicative and the new formulas provide more accurate results. This research advances our understanding of the interdependency between frequency and text complexity and provides a framework for effective implementation of lexical frequency patterns in discourse complexity studies. The findings can be implemented by textbooks writers and test developers to select and modify texts for specific categories of readers. Other areas of application include website design, surveys, and semantic analysis of social networks.
Key words and phrases:
text readability formula, Russian, school textbooks.
Received: 06.09.2023
Citation:
V. Solovyev, V. Ivanov, M. Solnyshkina, “Readability formulas for three levels of Russian school textbooks”, Investigations on applied mathematics and informatics. Part II–1, Zap. Nauchn. Sem. POMI, 529, POMI, St. Petersburg, 2023, 140–156
Linking options:
https://www.mathnet.ru/eng/znsl7424 https://www.mathnet.ru/eng/znsl/v529/p140
|
Statistics & downloads: |
Abstract page: | 70 | Full-text PDF : | 33 | References: | 21 |
|