IMPLEMENTED STEMMING ALGORITHMS BASED ON FINITE STATE MACHINE FOR UZBEK VERBS

Abstract

This article presents the application of stemming, one of the most important aspects of NLP-Natural Language Processing, of the Uzbek verbs. The methodology is proposed for doing the stemming of the Uzbek verb words with a affix stripping approach whereas not including any lexicon. Verb affixes are classified into three classes and designed the finite state machines (FSMs) for each class according morphological rules. A stemming application for Uzbek verb words has been developed based the FSMs.