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.
Type de document :
Communication dans un congrès
Gérard Huet and Amba Kulkarni. First International Sanskrit Computational Linguistics Symposium, Oct 2007, Rocquencourt, France. 2007, http://hal.inria.fr/SANSKRIT/fr/
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00203459
Contributeur : Brigitte Briot <>
Soumis le : jeudi 10 janvier 2008 - 11:13:52
Dernière modification le : dimanche 22 juillet 2018 - 09:10:03

Fichier

Goyal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00203459, version 1

Collections

Citation

Pawan Goyal, Vipul Arora, Laxmidhar Behera. Analysis of Sanskrit text : parsing and semantic relations. Gérard Huet and Amba Kulkarni. First International Sanskrit Computational Linguistics Symposium, Oct 2007, Rocquencourt, France. 2007, http://hal.inria.fr/SANSKRIT/fr/. 〈inria-00203459〉

Partager

Métriques

Consultations de la notice

195

Téléchargements de fichiers

279