Articles
Abstract
In this paper, a stemming algorithm has been developed using a
lexicon of linguistic rules and a database of normal word forms for the Uzbek
language. The accuracy of the proposed algorithm depends on the accuracy of the
tokenization algorithm. At the same time, the issue of finding the roots of compound
words separated by spaces was not considered here, since this problem is solved
directly at the tokenization stage.