Skip to Main content Skip to Navigation
Conference papers

Modeling Paninian Grammar

Abstract : It is possible to achieve the implementation of generative grammars and parsers of Sanskrit using various methodologies which have varying degrees of affinity to those of Paninian grammar. The current paper compares obvious methods to implement a few aspects of Sanskrit grammar computationally, comments upon the degree to which they approach or depart from Paninian methodology and exemplifies methods that would achieve a closer model. Two questions essential to determining a basic framework in which to implement Paninian grammar computationally are dealt with in some detail: the question of levels and the role of semantics.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00207938
Contributor : Brigitte Briot <>
Submitted on : Friday, January 18, 2008 - 3:50:38 PM
Last modification on : Thursday, February 28, 2008 - 3:51:15 PM
Long-term archiving on: : Tuesday, April 13, 2010 - 11:10:58 PM

File

Scharf.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00207938, version 1

Collections

Citation

Peter Scharf. Modeling Paninian Grammar. First International Sanskrit Computational Linguistics Symposium, Oct 2007, Rocquencourt, France. ⟨inria-00207938⟩

Share

Metrics

Record views

165

Files downloads

459