DocumentCode
3309643
Title
Uyghur noun suffix Finite State Machine for stemming
Author
Wumaier, Aishan ; Tursun, Parida ; Kadeer, Zaokere ; Yibulayin, Tuergen
Author_Institution
Sch. of Inf. Sci. & Eng., Xinjiang Univ., Urumqi, China
fYear
2009
fDate
8-11 Aug. 2009
Firstpage
161
Lastpage
164
Abstract
In this paper, we report on the generation of Uyghur noun suffix DFA generation for a stemming algorithm. Because of the agglutinative nature of Uyghur language, stemming is an essential task for Uyghur language processing applications. In Uyghur, the suffixes are affixed to the stem according to definite ordering rules. The agglutinative and rule-based nature of word formations in Uyghur allows modeling of the morphological structure of language in Finite State Machines (FSMs). In this study, FSM is formed by using the morphotactic rules in reverse order. This paper describes the steps of forming the reverse ordered Uyghur language noun suffix FSM.
Keywords
finite state machines; natural language processing; Uyghur language processing applications; Uyghur noun suffix DFA generation; Uyghur noun suffix finite state machine; morphological structure; morphotactic rules; rule-based nature; stemming algorithm; word formations; Asia; Automata; Dictionaries; Doped fiber amplifiers; Educational institutions; Eyes; Information retrieval; Information science; Instruments; Natural languages; component; finite state machine; stemming; uyghur;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-4519-6
Electronic_ISBN
978-1-4244-4520-2
Type
conf
DOI
10.1109/ICCSIT.2009.5234451
Filename
5234451
Link To Document