# Uzbek affix finite state machine for stemming

arXiv: https://arxiv.org/abs/2205.10078 · HTML: https://mlsanity.com/paper/2205.10078/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- Builds on 0 of its 14 references that are in the map.
- First posted on arXiv 20 May 2022.

## Built on by (most cited first, 3 of 3)

- [Development of a rule-based lemmatization algorithm through Finite State Machine for Uzbek language](https://mlsanity.com/paper/2210.16006/) (2022)
- [UzbekTagger: The rule-based POS tagger for Uzbek language](https://mlsanity.com/paper/2301.12711/) (2023)
- [UzMorphAnalyser: A Morphological Analysis Model for the Uzbek Language Using Inflectional Endings](https://mlsanity.com/paper/2405.14179/) (2024)

## Abstract (arXiv)

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.