Simulating the paninian system of sanskrit grammar

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a model for computer representation of the Paninian system of sanskrit grammar. Based on this model, we render the grammatical data and simulate the rules of As.t.ādhyāȳý on computer. We then employ these rules for generation of morpho-syntactical components of the language. These generated components we store in ap-subsequential transducer. This we use to develop a lexicon on Pān.inian principles. We report briefly its implementation.

Cite

CITATION STYLE

APA

Mishra, A. (2009). Simulating the paninian system of sanskrit grammar. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5402, pp. 127–138). https://doi.org/10.1007/978-3-642-00155-0_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free