KFU. Card publication. Polysemy as a Complexity Predictor in school textbooks

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

POLYSEMY AS A COMPLEXITY PREDICTOR IN SCHOOL TEXTBOOKS

Form of presentation

Articles in international journals and collections

Year of publication

2023

Язык

английский

Authors, employees of KFU

Danilov Andrey Vladimirovich, author

Sharifullina Elvira Albertovna, author

Bibliographic description in the original language

Danilov A.V, Nuretdinova Z, Miftakhutdinov Z, Polysemy as a Complexity Predictor in school textbooks//Proceedings - International Conference on Developments in eSystems Engineering, DeSE. - 2023. - Vol., Is.. - P.721-725.

Annotation

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.

Keywords

text readability assessment, polysemous words, Russian language textbooks, correlation analysis, Spearman's coefficient, educational goals, text readability, NLTK, RuWordNet, text analysis, linguistics, computer science

The name of the journal

Proceedings - International Conference on Developments in eSystems Engineering, DeSE

URL

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85189304105&doi=10.1109%2fDeSE60595.2023.10468765&partnerID=40&md5=9ba7d5ef1bc3aa1b787288f8c29cee36

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=299492&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Danilov Andrey Vladimirovich	ru_RU
dc.contributor.author	Sharifullina Elvira Albertovna	ru_RU
dc.date.accessioned	2023-01-01T00:00:00Z	ru_RU
dc.date.available	2023-01-01T00:00:00Z	ru_RU
dc.date.issued	2023	ru_RU
dc.identifier.citation	Danilov A.V, Nuretdinova Z, Miftakhutdinov Z, Polysemy as a Complexity Predictor in school textbooks//Proceedings - International Conference on Developments in eSystems Engineering, DeSE. - 2023. - Vol., Is.. - P.721-725.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=299492&p_lang=2	ru_RU
dc.description.abstract	Proceedings - International Conference on Developments in eSystems Engineering, DeSE	ru_RU
dc.description.abstract	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.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	text readability assessment	ru_RU
dc.subject	polysemous words	ru_RU
dc.subject	Russian language textbooks	ru_RU
dc.subject	correlation analysis	ru_RU
dc.subject	Spearman's coefficient	ru_RU
dc.subject	educational goals	ru_RU
dc.subject	text readability	ru_RU
dc.subject	NLTK	ru_RU
dc.subject	RuWordNet	ru_RU
dc.subject	text analysis	ru_RU
dc.subject	linguistics	ru_RU
dc.subject	computer science	ru_RU
dc.title	Polysemy as a Complexity Predictor in school textbooks	ru_RU
dc.type	Articles in international journals and collections	ru_RU