Abstract
In the present paper, a formalization of the technique used by Pāṇini in his Śivasūtras for the denotation of sound classes is given. Furthermore, a general notion of Śivasūtras-alphabets and of Śivasūtras-sortability is developed. The presented main theorem poses three sufficient conditions for the Śivasūtras-sortability of sets of classes. Finally, the problem of ordering sets of classes which are not Śivasūtras-sortable is tackled and an outlook on modern problems which could be approached by Pāṇini technique is given.
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
Böhtlingk, O.: Pāṇinis Grammatik. Leipzig (1887); Reprinted, Hildesheim (1964)
Cardona, G.: Studies in Indian Grammarians I: The Method of Description Reflected in the Śiva-Sūtras. Transactions of the American Philosophical Society 59(1), 3–48 (1969)
Faddegon, B.: The Mnemotechnics of Pāṇini’s Grammar I: The Śiva-Sūtra. Acta Orientalia 7, 48–65 (1929)
Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations, Berlin (1999)
Kiparsky, P.: Economy and the construction of the Śivasūtras. In: Deshpande, M.M., Bhate, S. (eds.) Pāṇinian Studies. Ann Arbor, Michigan (1991)
Kornai, A.: Mathematical Linguistics. Springer, London (2008)
Kornai, A.: The generative power of feature geometry. Annals of Mathematics and Artificial Intelligence (8), 37–46 (1993)
Misra, V.N.: The Descriptive Technique of Pāṇini. An Introduction. Mouton & Co., The Hague (1966)
Petersen, W.: A Mathematical Analysis of Pāṇini’s Śivasūtras. Journal of Logic, Language, and Information 13(4), 471–489 (2004)
Petersen, W.: How formal concept lattices solve a problem of ancient linguistics. In: Dau, F., Mugnier, M.-L., Stumme, G. (eds.) ICCS 2005. LNCS, vol. 3596, pp. 337–352. Springer, Heidelberg (2005)
Petersen, W.: Linear coding of non-linear hierarchies – revitalization of an ancient classification method. In: Proceedings of the GfKl 2008 (submitted, 2008)
Petersen, W.: Zur Minimalität von Pāṇinis Śivasūtras – Eine Untersuchung mit Methoden der Formalen Begriffsanalyse. PhD thesis, University of Düsseldorf (2008)
Staal, F.J.: Artificial languages across sciences and civilizations. Journal of Indian Philosophy 34(1-2), 87–139 (2006)
Staal, F.J.: A method of linguistic description. Language 38, 1–10 (1962)
Staal, F.J.: The Sanskrit of science. Journal of Indian Philosophy 23(1), 73–127 (1995)
Zschalig, C.: Bipartite ferrers-graphs and planar concept lattices. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS, vol. 4390, pp. 313–327. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petersen, W. (2008). On the Construction of Śivasūtras-Alphabets. In: Kulkarni, A., Huet, G. (eds) Sanskrit Computational Linguistics. ISCLS 2009. Lecture Notes in Computer Science(), vol 5406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93885-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-93885-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93884-2
Online ISBN: 978-3-540-93885-9
eBook Packages: Computer ScienceComputer Science (R0)