Graphical Representation of Tripādī Rules of Aṣṭādhyāyī using Directed Acyclic Graphs and Implementation of Topological Sorting Algorithm

The tripādī section of the Aṣṭādhyāyī focuses on the principle of asiddhatva, meaning that earlier rules (prakaraṇas) are not visible to the latter rules. This technique implicitly establishes a linear ordering of the rules, allowing the rules of the tripādī to be modelled as a linear order relation.

This study takes an interdisciplinary approach, applying graph theory concepts to represent and analyze the tripādī rules. By representing these rules as Directed Acyclic Graphs (DAGs) and using topological sorting algorithms, the study aims to reconstruct and validate their inherent linear order. Such a computational model has potential applications in Sanskrit linguistic analysis, traditional grammar studies, and computational linguistics tools.

Specifically, it seeks to:

• To represent the linear ordering of the tripādī rules graphically using Directed Acyclic Graphs (DAGs).
• To reconstruct the ordering of the tripādī rules using a topological sorting algorithm.
• To validate the reconstructed order using soundness and completeness proofs.
• To explore the potential applications of the computational model in Sanskrit linguistics and natural language processing (NLP).

This is a project of Dr. Anand Mishra (South Asia Insitute - Heidelberg University)  and Dr. Anita Nikhil Shroff (Indian Institute of Science Education and Research, Pune)