Asiddhatva Principle in Computational Model of Aṣṭādhyāyī

  • Sridhar Subbanna
  • Shrinivasa Varakhedi
Conference paper

DOI: 10.1007/978-3-642-17528-2_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6465)
Cite this paper as:
Subbanna S., Varakhedi S. (2010) Asiddhatva Principle in Computational Model of Aṣṭādhyāyī. In: Jha G.N. (eds) Sanskrit Computational Linguistics. Lecture Notes in Computer Science, vol 6465. Springer, Berlin, Heidelberg


Pāṇini’s Aṣṭādhyāyī can be thought of as an automaton to generate Sanskrit words and sentences. Aṣṭādhyāyī consists of sūtras that are organized in a systematic manner. The words are derived from the roots and affixes by the application of these sūtras that follow a well defined procedure. Therefore, Aṣṭādhyāyī is best suited for computational modeling. A computational model with conflict resolution techniques was discussed by us (Sridhar et al, 2009)[12]. In continuation with that, this paper presents, an improvised computational model of Aṣṭādhyāyī. This model is further developed based on the principle of asiddhatva. A new mathematical technique called ‘filter’ is introduced to comprehensively envisage all usages of asiddhatva in Aṣṭādhyāyī.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sridhar Subbanna
    • 1
  • Shrinivasa Varakhedi
    • 2
  1. 1.Rashtriya Sanskrit VidyapeethaTirupatiIndia
  2. 2.Samskrita Academy, Osmania UniversityHyderabadIndia

Personalised recommendations