On the Construction of Śivasūtras-Alphabets

Authors:
Wiebke Petersen
Affiliations:
Heinrich-Heine University Düsseldorf, Düsseldorf, Germany 40225
Venue:
Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics
Year:
2008

Citing 5
Cited 0

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
Bipartite Ferrers-graphs and planar concept lattices

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Mathematical Linguistics

Mathematical 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the present paper, a formalization of the technique used byPānini in his Śivasūtras for the denotation of soundclasses is given. Furthermore, a general notion ofŚivasūtras-alphabets and ofŚivasūtras-sortability is developed. The presented maintheorem poses three sufficient conditions for theŚivasūtras-sortability of sets of classes. Finally, theproblem of ordering sets of classes which are notŚivasūtras-sortable is tackled and an outlook on modernproblems which could be approached by Pānini technique isgiven.