Sanskrit Studies - Publications

Permanent URI for this collection

https://dspace.uohyd.ac.in/handle/1/89

Browse

Browsing Sanskrit Studies - Publications by Author "Goyal, Pawan"
  • Item
    A distributed platform for sanskrit processing
    ( 2012-12-01) Goyal, Pawan ; Huet, Gérard ; Kulkarni, Amba ; Scharf, Peter ; Bunker, Ralph
    Sanskrit, the classical language of India, presents specific challenges for computational linguistics: exact phonetic transcription in writing that obscures word boundaries, rich morphology and an enormous corpus, among others. Recent international cooperation has developed innovative solutions to these problems and significant resources for linguistic research. Solutions include efficient segmenting and tagging algorithms and dependency parsers based on constraint programming. The integration of lexical resources, text archives and linguistic software is achieved by distributed interoperable Web services. Resources include a morphological tagger and tagged corpus. © 2012 The COLING.
  • Item
    Computer simulation of astadhyayaý: Some insights
    ( 2009-07-15) Goyal, Pawan ; Kulkarni, Amba ; Behera, Laxmidhar
    Pān.ini's As.t.ādhyāȳý is often compared to a computer program for its rigour and coverage of the then prevalent Sanskrit language.The emergence of computer science has given a new dimension to the Paninian studies as is evident from the recent efforts by Mishra [7], Hyman[5] and Scharf [10]. Ours is an attempt to discover programming concepts, techniques and paradigms employed by Panini. We discuss how the three sūtras: pūrvatrāsiddham 8.2.1, a siddhavad atrābhāt at 6.4.22, and satvatukorasiddhah. 6.1.86 play a major role in the ordering of the sūtras and provide a model which can be best described with privacy of data spaces. For conflict resolution, we use two criteria: utsarga apavada relation between sūtras, and the word integrity principle. However, this needs further revision. The implementation is still in progress. The current implementation of inflectional morphology to derive a speech form is discussed in detail.
  • Item
    Converting phrase structures to dependency structures in Sanskrit
    ( 2014-01-01) Goyal, Pawan ; Kulkarni, Amba
    Two annotations schemes for presenting the parsed structures are prevalent viz. The constituency structure and the dependency structure. While the constituency trees mark the relations due to positions, the dependency relations mark the semantic dependencies. Free word order languages like Sanskrit pose more problems for constituency parses since the elements within a phrase are dislocated. In this work, we show how the enriched constituency tree with the information of displacement can help construct the unlabelled dependency tree automatically.