Abstract
In this paper the concept of Finite states is applied to design Recognizers for certain morphemes in Khasi language. Individual Grammar Class is implemented using Finite State Automata. Then Finite state automata are implemented to design a Morphological Analyzer for Nouns and Verbs. These Finite state automata can be concatenated one after the other to recognize Sentence Rules. Hence these can be used to design a Morphological Analyzer for legitimate sentences in the Khasi language.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.