z-logo
open-access-imgOpen Access
Avyaya Analyzer: Analysis of Indeclinables using Finite State Transducers
Author(s) -
Narayana S. Murali,
Prof. R. J. Ramasree,
Prof. K. V. R. K. Acharyulu
Publication year - 2012
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/4610-6825
Subject(s) - computer science , spectrum analyzer , state (computer science) , transducer , finite state , acoustics , algorithm , telecommunications , physics , machine learning , markov chain
1. INTRODUCTIONLanguage Processing (NLP) is a branch of Artificial Intelligence and deals with the Analysis of Human Languages. Each language consists of a set of words called lexicon and a set of rules called grammar. These enable the use of words to form cognitional valid sentences. NLP deals with both the Spoken as well as Written Languages. The goal of a researcher in NLP is to develop a Parser to analyze any human language. A typical language parser can be divided into 3 components [8] viz., Morphological Analyzer, Local Word Grouper and Core Parser. A Sentence is the input for the Parser. A sentence is a group of interrelated words. Every word in the sentence has its own meaning and is encoded grammatically. Further it is related to other words in the sentence. Morphological Analyzer (MA) will take each word in the sentence and retrieve the information encoded in the word. With the help of the information produced by the MA, Local Word Grouper (LWG) will try to identify the phrases in the sentence by grouping the words which have mutual relationship in the sentence. Parser will generate the parsed structure of the sentence.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom