Computational Kāraka Analysis (Dependency Parsing) And Anvaya Reconstruction in The Verses of Bhaṭṭikāvya

The Bhaṭṭikāvya, also known as the Rāvaṇavadha, occupies a distinctive position in Sanskrit literature because it combines the narrative of Rāma with systematic illustration of grammatical principles. This character makes the text particularly suitable for computational linguistic research. The present study proposes a framework for computational kāraka analysis, dependency parsing, and anvaya reconstruction in the verses of the Bhaṭṭikāvya. Sanskrit presents special computational challenges because of its rich inflection, sandhi, compounds, ellipsis, relatively free word order, and the stylistic rearrangement of words in poetry. A successful parser therefore has to integrate morphological analysis with verbal valency, kāraka relations, dependency structure, and contextual disambiguation. The study argues that Pāṇiniankāraka theory provides a valuable theoretical basis for representing syntactico-semantic relations in Sanskrit, while dependency parsing offers a computational representation of those relations. It further proposes that anvaya reconstruction can be treated as a controlled reordering of a dependency graph into a canonical prose-oriented sequence. The research has implications for Sanskrit NLP, digital humanities, grammatical pedagogy, corpus creation, and computational interpretation of classical Sanskrit literature.