TY - JOUR

T1 - BERT-like Models for Automatic Morpheme Segmentation of the Russian Language

AU - Morozov, Dmitry

AU - Glazkova, Anna

AU - Garipov, Timur

PY - 2025

Y1 - 2025

N2 - Current approaches to automatic morpheme segmentation for the Russian language rely on machine learning, primarily neural network methods. Among the architectures presented, the best results have been achieved using convolutional neural networks and LSTM networks. However, the quality of automatic annotation is far from ideal, especially when dealing with roots that were not present in the training dataset. In this work, we present a new approach to morpheme segmentation based on fine-tuning BERT-like models. Through comparisons using two morpheme dictionaries with different segmentation paradigms, we demonstrated the superiority of our approach over previous ones, including when working with unfamiliar roots. The best result was achieved by fine-tuning the RuRoBERTa-large model: when working with random words, the share of completely correct segmentations increased from 88.5-90.8% to 92.5-93.5%, and when working with unfamiliar roots, it improved from 70.5-72.6% to 74.9-77.2%. Error analysis of the model showed that root nests not encountered in the training dataset can be distributed into two groups during testing: "recognizable", meaning those for which more than 90% of the words are correctly analyzed, and "unknown", meaning those for which the proportion of correct segmentations is less than 10%.

AB - Current approaches to automatic morpheme segmentation for the Russian language rely on machine learning, primarily neural network methods. Among the architectures presented, the best results have been achieved using convolutional neural networks and LSTM networks. However, the quality of automatic annotation is far from ideal, especially when dealing with roots that were not present in the training dataset. In this work, we present a new approach to morpheme segmentation based on fine-tuning BERT-like models. Through comparisons using two morpheme dictionaries with different segmentation paradigms, we demonstrated the superiority of our approach over previous ones, including when working with unfamiliar roots. The best result was achieved by fine-tuning the RuRoBERTa-large model: when working with random words, the share of completely correct segmentations increased from 88.5-90.8% to 92.5-93.5%, and when working with unfamiliar roots, it improved from 70.5-72.6% to 74.9-77.2%. Error analysis of the model showed that root nests not encountered in the training dataset can be distributed into two groups during testing: "recognizable", meaning those for which more than 90% of the words are correctly analyzed, and "unknown", meaning those for which the proportion of correct segmentations is less than 10%.

KW - автоматическое построение морфемных разборов

KW - морфемика русского языка

KW - машинное обучение

KW - BERT

KW - automatic morpheme segmentation

KW - Russian language morphology

KW - machine learning

KW - BERT

UR - https://www.scopus.com/pages/publications/105039321242

UR - https://www.mendeley.com/catalogue/e964675e-19c2-3a9f-a96e-e2a90a7820fa/

U2 - 10.28995/2075-7182-2025-23-257-266

DO - 10.28995/2075-7182-2025-23-257-266

M3 - Conference article

SP - 206

EP - 223

JO - Компьютерная лингвистика и интеллектуальные технологии

JF - Компьютерная лингвистика и интеллектуальные технологии

SN - 2221-7932

IS - 23

T2 - International Conference “Dialogue 2025”: Computational Linguistics and Intellectual Technologies

Y2 - 23 April 2025 through 25 April 2025

ER -