Skip to Main content Skip to Navigation
Conference papers

Analysis of Sanskrit text : parsing and semantic relations

Abstract : In this paper, we are presenting our work towards building a dependency parser for Sanskrit language that uses deterministic finite automata(DFA) for morphological analysis and 'utsarga apavaada' approach for relation analysis. A computational grammar based on the framework of Panini is being developed. A linguistic generalization for Verbal and Nominal database has been made and declensions are given the form of DFA. Verbal database for all the class of verbs have been completed for this part. Given a Sanskrit text, the parser identifies the root words and gives the dependency relations based on semantic constraints. The proposed Sanskrit parser is able to create semantic nets for many classes of Sanskrit paragraphs( _______ __ ). The parser is taking care of both external and internal sandhi in the Sanskrit words.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Brigitte Briot <>
Submitted on : Thursday, January 10, 2008 - 11:13:52 AM
Last modification on : Sunday, July 22, 2018 - 9:10:03 AM


Files produced by the author(s)


  • HAL Id : inria-00203459, version 1



Pawan Goyal, Vipul Arora, Laxmidhar Behera. Analysis of Sanskrit text : parsing and semantic relations. First International Sanskrit Computational Linguistics Symposium, INRIA Paris-Rocquencourt, Oct 2007, Rocquencourt, France. ⟨inria-00203459⟩



Record views


Files downloads