Finite State Automata as Analyzers of certain Grammar Class Rules in the Khasi Language

@article{Fin1697422, author = {Aiusha V. Hujon}, title = {Finite State Automata as Analyzers of certain Grammar Class Rules in the Khasi Language}, journal={International Journal of Computing Algorithm}, volume={5}, issue={1}, issn = {2278-2397}, year = {2016}, publisher = {Scholarly Citation Index Analytics-SCIA} }

<?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2016</publicationDate> <volume>5</volume> <issue>1</issue> <startPage>21</startPage> <endPage>22</endPage> <documentType>article</documentType> <title language='eng'>Finite State Automata as Analyzers of certain Grammar Class Rules in the Khasi Language</title> <authors> <author> <name>Aiusha V. Hujon</name> </author> </authors> <abstract language='eng'>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.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2016/p974.pdf</fullTextUrl> <keywords language='eng'> <keyword>Morphological analyzer, Finite state automata, khasi language, word analyzers, Austroasiatic languages, word recognizer, Natrual language processing.</keyword> </keywords> </record>

{ "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2016/article.php?page=974", "name":"Finite State Automata as Analyzers of certain Grammar Class Rules in the Khasi Language", "author":[{"name":"Aiusha V. Hujon "}], "datePublished":"2016", "description":"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.", "keywords":["Morphological analyzer, Finite state automata, khasi language, word analyzers, Austroasiatic languages, word recognizer, Natrual language processing."], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>Aiusha V. Hujon</dc:creator> <dc:date>2016</dc:date> <dc:description>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.</dc:description> <dc:identifier>2016SCIA316F0974</dc:identifier> <dc:language>eng</dc:language> <dc:title>Finite State Automata as Analyzers of certain Grammar Class Rules in the Khasi Language</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

{ "identifier": "2016SCIA316F0974", "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.", "author": [ { "family": "Aiusha V. Hujon," } ], "id": "974", "issued": { "date-parts": [ [ 2016 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Finite State Automata as Analyzers of certain Grammar Class Rules in the Khasi Language", "type": "publication-article", "version": "3" }