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ī.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Giri, S.P., Satyanarayanashastri.: Paṇinīyaḥ Aṣṭādhyāyī. Krishnadas Academy, Varanasi (1984)
Bhargava Sastri, B.J.: The Vyākaraṇamahābhāṣya of Patañjali. Chaukhamba Sanskrit Pratishtan, Delhi (1872)
Kielhorn, F.: Paribhāṣenduśekhara of Nāgojibhaṭṭa. Parimal Publications, Delhi
Mishra, S.: Kāśikā. Chaukamba Samskrita Samsthan, Varanasi (1979)
Abhyankar, K.V.: Paribhashasamgraha. Bhandarkar Research Instt, Puna (1967)
Kak, S.: The Paninian approach to natural language processing. International Journal of Approximate Reasoning 1, 117–130 (1987)
Kiparsky, P.: On the Architecture of Panini’s Grammar
Bhate, S., Kak, S.: Panini’s Grammar and Computer Science
Vasu, S.C.: The Aṣṭādhyāyī of Pāṇini. Motilal Banarasidas Publishers, New Delhi (2003)
Vasu, S.C.: Siddhānta Kaumudi, Motilal Banarasidas Publishers, New Delhi (2002)
Cardona, G.: pūrvatrāsiddham and āsrayātsiddham, MS
Sridhar, S., Srinivasa, V.: Computational Structure of Aṣṭādhyāyī and Conflict Resolution Techniques. In: Kulkarni, A., Huet, G. (eds.) Sanskrit Computational Linguistics. LNCS (LNAI), vol. 5406. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subbanna, S., Varakhedi, S. (2010). Asiddhatva Principle in Computational Model of Aṣṭādhyāyī. In: Jha, G.N. (eds) Sanskrit Computational Linguistics. ISCLS 2010. Lecture Notes in Computer Science(), vol 6465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17528-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-17528-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17527-5
Online ISBN: 978-3-642-17528-2
eBook Packages: Computer ScienceComputer Science (R0)