Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
On the Construction of Śivasūtras-Alphabets
Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics
How formal concept lattices solve a problem of ancient linguistics
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
| Hi-index | 0.01 |
In Pāṇini’ grammar of Sanskrit one finds the Śivasūtras, a table which defines the natural classes of phonological segments in Sanskrit by intervals. We present a formal argument which shows that, using his representation method, Pāṇini’ way of ordering the phonological segments to represent the natural classes is optimal. The argument is based on a strictly set-theoretical point of view depending only on the set of natural classes and does not explicitly take into account the phonological features of the segments, which are, however, implicitly given in the way a language clusters its phonological inventory. The key idea is to link the graph of the Hasse-diagram of the set of natural classes closed under intersection to Śivasūtras-style representations of the classes. Moreover, the argument is so general that it allows one to decide for each set of sets whether it can be represented with Pāṇini’ method. Actually, Pāṇini had to modify the set of natural classes to define it by the Śivasūtras (the segment h plays a special role). We show that this modification was necessary and, in fact, the best possible modification. We discuss how every set of classes can be modified in such a way that it can be defined in a Śivasūtras-style representation.1