Uzbek affix finite state machine for stemming

Abstract

This work presents a morphological analyzer for the Uzbek language using a finite state machine. The proposed methodology is a morphologic analysis of Uzbek words by using an affix striping to find a root and without including any lexicon. This method helps to perform morphological analysis of words from a large amount of text at high speed as well as it is not required using of memory for keeping vocabulary. According to Uzbek, an agglutinative language can be designed with finite state machines (FSMs). In contrast to the previous works, this study modeled the completed FSMs for all word classes by using the Uzbek language's morphotactic rules in right to left order. This paper shows the stages of this methodology including the classification of the affixes, the generation of the FSMs for each affix class, and the combination into a head machine to make analysis a word.

More by Ulugbek Salaev

• A SINGLE-LAYER FEEDFORWARD NEURAL NETWORK MODEL FOR MORPHOLOGICAL STEMMING OF UZBEK WORDSIlmiy axborotnoma/Scientific Journal of Samarkand University · 2026
• Comparative Analysis of Neural Sequence Labeling Approaches for Uzbek Morphological ModelingInternational Siberian workshops and tutorials on electron devices and materials · 2026
• Neural Sequence Models for Uzbek Morphological StemmingInternational Scientific-Technical Conference on Actual Problems of Electronic Instrument Engineering · 2025 · Citations: 7
• A Morphology-Aware Neural Network Model for Uzbek Text ClassificationInternational Scientific-Technical Conference on Actual Problems of Electronic Instrument Engineering · 2025 · Citations: 1