Chapter

Sanskrit Computational Linguistics

Volume 6465 of the series Lecture Notes in Computer Science pp 231-238

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

  • Sridhar SubbannaAffiliated withCarnegie Mellon UniversityRashtriya Sanskrit Vidyapeetha
  • , Shrinivasa VarakhediAffiliated withCarnegie Mellon UniversitySamskrita Academy, Osmania University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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ī.