Specifying Context free Grammar for Marathi Sentences
نویسنده
چکیده
Marathi is an Indo-Aryan Language and forms the official language of state of Maharashtra. It is ranked as the 4 most spoken language in India and 15 most spoken language in the world. When Computational Linguistic is concerned, writing grammar production for a language is a bit difficult because of different gender and number forms. This paper is an effort to write context free grammar for Marathi sentences. CFGs are very much suitable in expressing natural languages as well as programming languages and hence form a major part in field of natural language processing and pattern recognition. This paper highlights the process of specifying CFG for simple Marathi sentences General Terms Context Free Grammar, syntactical analysis, Pattern Recognition, linguistics, Parsing, Natural Language Processing
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملParsing Long English Sentences with Pattern Rules
In machine translation, parsing of long English sentences still causes some problems, whereas for short sentences a good machine translation system usually can generate readable translations. In this paper a practical method is presented for parsing long English sentences of some patterns. The rules for the patterns are treated separately from the augmented context free grammar, where each cont...
متن کاملStatistical Parsing with an Automatically-Extracted Tree Adjoining Grammar
Why use tree adjoining grammars (TAG) for statistical parsing? It might be thought that its added formal power makes parameter estimation unnecessarily difficult; or that whatever benefits it provides—the ability to model unbounded cross-serial dependencies, for example— are inconsequential for statistical parsing, which is concerned with the probable rather than the possible. But just as TAG i...
متن کاملStatistical Function Tagging and Grammatical Relations of Myanmar Sentences
This paper describes a context free grammar (CFG) based grammatical relations for Myanmar sentences which combine corpus-based function tagging system. Part of the challenge of statistical function tagging for Myanmar sentences comes from the fact that Myanmar has free-phrase-order and a complex morphological system. Function tagging is a pre-processing step to show grammatical relations of Mya...
متن کاملParsing the Wall Street Journal with the Inside-Outside Algorithm
We report grammar inference experiments on partially parsed sentences taken from the Wall Street Journal corpus using the inside-outside algorithm for stochastic context-free grammars. The initial grammar for the inference process makes no ,assumption of the kinds of structures and their distributions. The inferred grammar is evaluated by its predicting power and by comparing the bracketing of ...
متن کامل