How formal concept lattices solve a problem of ancient linguistics

Authors:
Wiebke Petersen
Affiliations:
Institute of Language and Information, Department of Computational Linguistics, University of Düsseldorf
Venue:
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
Year:
2005

Citing 2
Cited 1

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
A Mathematical Analysis of Pāṇini’s Śivasūtras

Journal of Logic, Language and Information

On the Construction of Śivasūtras-Alphabets

Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In his grammar of ancient Sanskrit, Pāṅini represents the phonological classes as intervals of a list. This representation method and especially the actual list constructed by Pāṅini, which is called the Śivasūtras, earns universal admiration. The legend says that god Śiva revealed the Śivasūtras to Pāṅini in order to let him start developing his grammar of Sanskrit. A question still discussed is whether it is possible to shorten the Śivasūtras. In the course of this paper, I am going to prove that this question can be reduced to a question about the graph-theoretical form of a particular formal concept lattice. Furthermore, I show how the Śivasūtras can be reconstructed from Pāṅini's grammar.