Uzbek affix finite state machine for stemming
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
POS-tagging to highlight the skeletal structure of sentences
Cellpose+, a morphological analysis tool for feature extraction of stained cell images
LLMs' morphological analyses of complex FST-generated Finnish words
CoDA: Interactive Segmentation and Morphological Analysis of Dendroid Structures Exemplified on Stony Cold-Water Corals
Lexically Grounded Subword Segmentation
Ultrasound Nodule Segmentation Using Asymmetric Learning with Simple Clinical Annotation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.