Simulating the Pāṇinian System of Sanskrit Grammar

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


We propose a model for computer representation of the Pāṇinian 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āṇinian principles. We report briefly its implementation.


Sanskrit Grammar Panini Ashtadhyayi Computational linguistics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    von Böhtlingk, O.: Pāṇini’s Grammatik. Olms, Hildesheim. Primary source text for our database (1887)Google Scholar
  2. 2.
    Dīkṣita, P.: Aṣṭādhyāyī sahajabodha, vol. 1-4. Pratibha Prakashan, Delhi, India (2006-2007)Google Scholar
  3. 3.
    Katre, S.M.: Aṣṭādhyāyī of Pāṇini. Motilal Banarsidass, Delhi, India (1989)Google Scholar
  4. 4.
    Mohri, M.: On some Applications of Finite-State Automata Theory to Natural Language Processing. Journal of Natural Language Engineering 2, 1–20 (1996)CrossRefGoogle Scholar
  5. 5.
    Śāstrī, C.: Vyākaraṇacandrodaya, vols. 1-5. Motilal Banarsidass, Delhi, India (1971)Google Scholar
  6. 6.
    Vasu, S.C., Vasu, V.D.: The Siddhānta-Kaumudī of Bhaṭṭojī Dīkṣita, vols. 1-3. Panini Office, Bhuvanesvara Asrama, Allahabad, India. Primary source text for prakriyā (1905)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Ruprecht Karls UniversityHeidelbergGermany

Personalised recommendations