Computer Simulation of Aṣṭ ādhyā yī: Some Insights

Authors:
Pawan Goyal;Amba Kulkarni;Laxmidhar Behera
Affiliations:
School of Computing and Intelligent Systems, University of Ulster, UK;Department of Sanskrit Studies, University of Hyderabad, India;School of Computing and Intelligent Systems, University of Ulster, UK and Department of Electrical Engineering, IIT Kanpur, India
Venue:
Sanskrit Computational Linguistics
Year:
2009

Citing 5
Cited 0

Concepts, Techniques, and Models of Computer Programming

Concepts, Techniques, and Models of Computer Programming
Computational Structure of the Aṣṭādhyāyī and Conflict Resolution Techniques

Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics
Modeling Pāninian Grammar

Sanskrit Computational Linguistics
Simulating the Pāninian System of Sanskrit Grammar

Sanskrit Computational Linguistics
From Pāninian Sandhi to Finite State Calculus

Sanskrit Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

PāniniAṣṭ ādhyā yī is often compared to a computer program for its rigour and coverage of the then prevalent Sanskrit language. The emergence of computer science has given a new dimension to the Pāninian studies as is evident from the recent efforts by Mishra [7], Hyman [5] and Scharf [10]. Ours is an attempt to discover programming concepts, techniques and paradigms employed by Pānini. We discuss how the three sūtras: pūrvatrā siddham 8.2.1, asiddhavad atrābhā t 6.4.22, and ṣatvatukor asiddhah 6.1.86 play a major role in the ordering of the sktras and provide a model which can be best described with privacy of data spaces. For conflict resolution, we use two criteria: utsarga-apavāda relation between sūtras, and the word integrity principle. However, this needs further revision. The implementation is still in progress. The current implementation of inflectional morphology to derive a speech form is discussed in detail.