Abstract
Pāṇini’s Aṣṭ ādhyā yī 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akshar, B., Chaitanya, V., Sangal, R.: Natural Language Processing: A Paninian Perspective. Prentice Hall of India, New Delhi (1995)
Bhate, S., Kak, S.: Panini’s grammar and Computer Science. Annals of the Bhandarkar Oriental Research Institute 72, 79–94 (1993)
Bronkhorst, J.: Asiddha in the Aṣṭādhyāyī: A misunderstanding among the traditional commentators. Journal of Indian Philosophy 8, 69–85 (1980)
Cardona, G.: On translating and formalizing Paninian rules. Journal of Oriental Institute, Baroda 14, 306–314
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)
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)
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)
Monier Williams, M.: A Sanskrit-English Dictionary. Clarendon, Oxford (1872) (reprint: Motilal Banarasidass, Delhi, 1997)
Roy, P.V., Haridi, S.: Concepts, Techniques and Models of Computer Programming. MIT Press, Cambridge (2004)
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)
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)
Vasu, S.C.: Siddhānta Kaumudi. Motilal Banarasidas Publishers, New Delhi (2002)
Vasu, S.C.: The Aṣṭādhyāyī of Pāṇini. Motilal Banarasidas Publishers, New Delhi (2003)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goyal, P., Kulkarni, A., Behera, L. (2009). Computer Simulation of Aṣṭ ādhyā yī: Some Insights. In: Huet, G., Kulkarni, A., Scharf, P. (eds) Sanskrit Computational Linguistics. ISCLS ISCLS 2007 2008. Lecture Notes in Computer Science(), vol 5402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00155-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-00155-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00154-3
Online ISBN: 978-3-642-00155-0
eBook Packages: Computer ScienceComputer Science (R0)