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

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5402)


Pāṇini’s Aṣṭ ādhyā 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āṇinian 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āṇini. We discuss how the three sūtras: pūrvatrā siddham 8.2.1, asiddhavad atrābhā t 6.4.22, and ṣatvatukor asiddhaḥ 6.1.86 play a major role in the ordering of the sūtras 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.


Pāṇini Aṣṭādhyā Computer Simulation Conflict Resolution Event Driven Programming Task Parallelism 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akshar, B., Chaitanya, V., Sangal, R.: Natural Language Processing: A Paninian Perspective. Prentice Hall of India, New Delhi (1995)Google Scholar
  2. 2.
    Bhate, S., Kak, S.: Panini’s grammar and Computer Science. Annals of the Bhandarkar Oriental Research Institute 72, 79–94 (1993)Google Scholar
  3. 3.
    Bronkhorst, J.: Asiddha in the Aṣṭādhyāyī: A misunderstanding among the traditional commentators. Journal of Indian Philosophy 8, 69–85 (1980)CrossRefGoogle Scholar
  4. 4.
    Cardona, G.: On translating and formalizing Paninian rules. Journal of Oriental Institute, Baroda 14, 306–314Google Scholar
  5. 5.
    Hyman, M.D.: From Paninian Sandhi to Finite State Calculus. In: Huet, G., Kulkarni, A., Scharf, P. (eds.) Sanskrit CL 2007/2008. LNCS (LNAI), vol. 5402, pp. 253–265. Springer, Heidelberg (2009)Google Scholar
  6. 6.
    Kiparsky, P.: On the architecture of Pāṇini grammar. The lectures delivered at the Hyderabad Conference on the Architecture of Grammar in 2002 (2002); final version published in Springer-Verlag LNCS 5402 (2009)Google Scholar
  7. 7.
    Mishra, A.: Simulating the Paninian system of Sanskrit Grammar. In: Huet, G., Kulkarni, A., Scharf, P. (eds.) Sanskrit CL 2007/2008. LNCS (LNAI), vol. 5402, pp. 127–138. Springer, Heidelberg (2009)Google Scholar
  8. 8.
    Monier Williams, M.: A Sanskrit-English Dictionary. Clarendon, Oxford (1872) (reprint: Motilal Banarasidass, Delhi, 1997)Google Scholar
  9. 9.
    Roy, P.V., Haridi, S.: Concepts, Techniques and Models of Computer Programming. MIT Press, Cambridge (2004)Google Scholar
  10. 10.
    Scharf, P.M.: Paninian Grammar. In: Huet, G., Kulkarni, A., Scharf, P. (eds.) Sanskrit CL 2007/2008. LNCS (LNAI), vol. 5402, pp. 95–126. Springer, Heidelberg (2009)Google Scholar
  11. 11.
    Subrahmanyam, P.S.: Pāṇinian Linguistics, Institute for the Study of Languages and Cultures of Asia and Africa, Tokyo University of Foreign Studies, Japan (1999)Google Scholar
  12. 12.
    Vasu, S.C.: Siddhānta Kaumudi. Motilal Banarasidas Publishers, New Delhi (2002)Google Scholar
  13. 13.
    Vasu, S.C.: The Aṣṭādhyāyī of Pāṇini. Motilal Banarasidas Publishers, New Delhi (2003)Google Scholar
  14. 14.
    Subbanna, S., Varakhedi, S.: Conflict Aṣṭādhyāyī and Conflict Resolution Techniques. In: Kulkarni, A., Huet, G. (eds.) Sanskrit Computational Linguistics. LNCS, vol. 5406, pp. 56–65. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.School of Computing and Intelligent SystemsUniversity of UlsterUK
  2. 2.Department of Sanskrit StudiesUniversity of HyderabadIndia
  3. 3.Department of Electrical EngineeringIIT KanpurIndia

Personalised recommendations