On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Computer Simulation of Aṣṭ ādhyā yī: Some Insights
Sanskrit Computational Linguistics
| Hi-index | 0.00 |
We propose a model for computer representation of the Pāninian system of sanskrit grammar. Based on this model, we render the grammatical data and simulate the rules of Aṣṭ ādhyā yī on computer. We then employ these rules for generation of morpho-syntactical components of the language. These generated components we store in a p-subsequential transducer. This we use to develop a lexicon on Pāninian principles. We report briefly its implementation.