Search Results for author: Pavankumar Satuluri

Found 11 papers, 3 papers with code

A Graph-Based Framework for Structured Prediction Tasks in Sanskrit

no code implementations CL (ACL) 2020 Amrith Krishna, Bishal Santra, Ashim Gupta, Pavankumar Satuluri, Pawan Goyal

Ours is a search-based structured prediction framework, which expects a graph as input, where relevant linguistic information is encoded in the nodes, and the edges are then used to indicate the association between these nodes.

Dependency Parsing Structured Prediction

DepNeCTI: Dependency-based Nested Compound Type Identification for Sanskrit

1 code implementation14 Oct 2023 Jivnesh Sandhan, Yaswanth Narsupalli, Sreevatsa Muppirala, Sriram Krishnan, Pavankumar Satuluri, Amba Kulkarni, Pawan Goyal

This work introduces the novel task of nested compound type identification (NeCTI), which aims to identify nested spans of a multi-component compound and decode the implicit semantic relations between them.

Constituency Parsing named-entity-recognition +2

Aesthetics of Sanskrit Poetry from the Perspective of Computational Linguistics: A Case Study Analysis on Siksastaka

1 code implementation14 Aug 2023 Jivnesh Sandhan, Amruta Barbadikar, Malay Maity, Pavankumar Satuluri, Tushar Sandhan, Ravi M. Gupta, Pawan Goyal, Laxmidhar Behera

We provide a deep analysis of Siksastaka, a Sanskrit poem, from the perspective of 6 prominent kavyashastra schools, to illustrate the proposed framework.

Neural Approaches for Data Driven Dependency Parsing in Sanskrit

no code implementations17 Apr 2020 Amrith Krishna, Ashim Gupta, Deepak Garasangi, Jivnesh Sandhan, Pavankumar Satuluri, Pawan Goyal

We compare the performance of each of the models in a low-resource setting, with 1, 500 sentences for training.

Dependency Parsing

Compound Type Identification in Sanskrit: What Roles do the Corpus and Grammar Play?

no code implementations WS 2016 Amrith Krishna, Pavankumar Satuluri, Shubham Sharma, Apurv Kumar, Pawan Goyal

We construct an elaborate features space for our system by combining conditional rules from the grammar \textit{Adṣṭ{\=a}dhy{\=a}y{\=\i}}, semantic relations between the compound components from a lexical database \textit{Amarakoṣa} and linguistic structures from the data using Adaptor Grammars.

Classification General Classification +2

Cannot find the paper you are looking for? You can Submit a new open access paper.