A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
Journal of Functional Programming
Computer Simulation of Aṣṭ ādhyā yī: Some Insights
Sanskrit Computational Linguistics
| Hi-index | 0.00 |
The current paper compares obvious methods to implement a few aspects of Sanskrit grammar computationally, comments upon the degree to which they approach or depart from Pāninian methodology and exemplifies methods that would achieve a closer model. Two questions essential to determining a basic framework in which to implement Pāninian grammar computationally are dealt with in some detail: the question of levels and the role of semantics.Pānini does not operate with a fourfold hierarchy of modular levels that segregates semantics, syntax, morphology, and phonetics. Rather he conceives of two levels, meaning and sound, generating the latter from the former. He achieves the complex mapping of the former onto the latter utilizing a number of stages that do not correspond neatly to the four modules articulated in modern generative grammar. Although Pānini does not state semantic rules, he does operate with numerous semantic categories and sometimes utilizes morphophonemic categories to determine such categories.