Abstract
The article analyzes the existing morphological analyzers related to agglutinative languages. The architecture of the morphological analyzer for the Uzbek language is proposed, the functionality is described using the IDEF0 model, and a finite-state transducer for grammatical and morphological rules is created. Here also described a formal mathematical model for rules morphotactics. Based on the rules of grammar, morphotactics, morphonology, an algorithm was developed using a finite state machine and a transducer.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
