# Development of a rule-based lemmatization algorithm through Finite State Machine for Uzbek language

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

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- Builds on 2 of its 17 references that are in the map.
- First posted on arXiv 28 Oct 2022.

## Builds on (most cited first, 2 of 2)

- [Cross-Lingual Word Embeddings for Turkic Languages](https://mlsanity.com/paper/2005.08340/) (2020)
- [Uzbek affix finite state machine for stemming](https://mlsanity.com/paper/2205.10078/) (2022)

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

- [UzbekTagger: The rule-based POS tagger for Uzbek language](https://mlsanity.com/paper/2301.12711/) (2023)
- [Uzbek text summarization based on TF-IDF](https://mlsanity.com/paper/2303.00461/) (2023)
- [Uzbek text's correspondence with the educational potential of pupils: a case study of the School corpus](https://mlsanity.com/paper/2303.00465/) (2023)
- [UzMorphAnalyser: A Morphological Analysis Model for the Uzbek Language Using Inflectional Endings](https://mlsanity.com/paper/2405.14179/) (2024)

## Abstract (arXiv)

Lemmatization is one of the core concepts in natural language processing, thus creating a lemmatization tool is an important task. This paper discusses the construction of a lemmatization algorithm for the Uzbek language. The main purpose of the work is to remove affixes of words in the Uzbek language by means of the finite state machine and to identify a lemma (a word that can be found in the dictionary) of the word. The process of removing affixes uses a database of affixes and part of speech knowledge. This lemmatization consists of the general rules and a part of speech data of the Uzbek language, affixes, classification of affixes, removing affixes on the basis of the finite state machine for each class, as well as a definition of this word lemma.