Department of Sanskrit Studies

Permanent URI for this community

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

Browse

Browsing Department of Sanskrit Studies by Author "Kulkarni, Amba"
  • Item
    A Deterministic Dependency Parser with Dynamic Programming for Sanskrit
    ( 2013-01-01) Kulkarni, Amba
    We describe a Deterministic Dependency Parser for Sanskrit. The parse is developed following a Depth First traversal of a graph whose nodes represent morphological analyses of the words in a sentence. During the traversal, relations at each node are checked for local compatibility, and finally for each full path, the relations on the path are checked for global compatibility. Stacking of intermediate results guarantees dynamic programming. We also describe an interface that displays multiple parses compactly and facilitates users to select the desired parse among various possible solutions with a maximum of n − 1 choices for a sentence with n words.
  • 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
    Constituency parsing of complex noun sequences in hindi
    ( 2014-01-01) Batra, Arpita ; Paul, Soma ; Kulkarni, Amba
    A complex noun sequence is one in which a head noun is recursively modified by one or more bare nouns and/or genitives Constituency analysis of complex noun sequence is a prerequisite for finding dependency relation (semantic relation) between components of the sequence. Identification of dependency relation is useful for various applications such as question answering, information extraction, textual entailment, paraphrasing. In Hindi, syntactic agreement rules can handle to a large extent the parsing of recursive genitives (Sharma, 2012)[12].This paper implements frequency based corpus driven approaches for parsing recursive genitive structures that syntactic rules cannot handle as well as recursive compound nouns and combination of gentive and compound noun sequences. Using syntactic rules and dependency global algorithm, an accuracy of 92.85% is obtained. © 2014 Springer-Verlag Berlin Heidelberg.
  • 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.
  • Item
    Designing a constraint based parser for Sanskrit
    ( 2010-12-01) Kulkarni, Amba ; Pokar, Sheetal ; Shukl, Devanand
    Verbal understanding (śābdabodha) of any utterance requires the knowledge of how words in that utterance are related to each other. Such knowledge is usually available in the form of cognition of grammatical relations. Generative grammars describe how a language codes these relations. Thus the knowledge of what information various grammatical relations convey is available from the generation point of view and not the analysis point of view. In order to develop a parser based on any grammar one should then know precisely the semantic content of the grammatical relations expressed in a language string, the clues for extracting these relations and finally whether these relations are expressed explicitly or implicitly. Based on the design principles that emerge from this knowledge, we model the parser as finding a directed Tree, given a graph with nodes representing the words and edges representing the possible relations between them. Further, we also use the Mīmā msā constraint of ākānksā (expectancy) to rule out non-solutions and sannidhi (proximity) to prioritize the solutions. We have implemented a parser based on these principles and its performance was found to be satisfactory giving us a confidence to extend its functionality to handle the complex sentences. © 2010 Springer-Verlag Berlin Heidelberg.
  • Item
  • Item
    Sanskrit compound processor
    ( 2010-12-01) Kumar, Anil ; Mittal, Vipul ; Kulkarni, Amba
    Sanskrit is very rich in compound formation. Typically a compound does not code the relation between its components explicitly. To understand the meaning of a compound, it is necessary to identify its components, discover the relations between them and finally generate a paraphrase of the compound. In this paper, we discuss the automatic segmentation and type identification of a compound using simple statistics that results from the manually annotated data. © 2010 Springer-Verlag Berlin Heidelberg.
  • Item
    Sanskrit linguistics web services
    ( 2014-01-01) Huet, Gérard ; Kulkarni, Amba
    We propose to demonstrate a collection of tools for Sanskrit Computational Linguistics developed by cooperating teams in the general setting of Web services. These services offer a systematic architecture integrating multilingual lexicons, morphological generation and analysis, segmentation and parsing, and interlink with the Sanskrit Library digital repository. They may be used as distributed Internet services, or installed as local tools on individual users workstations.
  • Item
    Sanskrit Parsing following Indian Theories of Verbal Cognition
    ( 2021-04-01) Kulkarni, Amba
    Pini's grammar is an important milestone in the Indian grammatical tradition. Unlike grammars of other languages, it is almost exhaustive and together with the theories of śAbdabodha (verbal cognition), this grammar provides a system for language analysis as well as generation. The theories of śAbdabodha describe three conditions necessary for verbal cognition. They are £A (expectancy), yogyatA (meaning congruity), and sannidhi (proximity). We examine them from a computational viewpoint and provide appropriate computational models for their representation. Next, we describe the design of a parser following the theories of śAbdabodha and present three algorithms for solving the constraints imposed by the theories of śAbdabodha. The first algorithm is modeled as a constraint satisfaction problem, the second one as a vertex-centric graph traversal, and the third one as an edge-centric binary join, each one being an improvement over the previous one.
  • Item
    Semantic processing of compounds in indian languages
    ( 2012-12-01) Kulkarni, Amba ; Paul, Soma ; Kulkarni, Malhar ; Kumar, Anil ; Surtani, Nitesh
    Compounds occur very frequently in Indian Languages. There are no strict orthographic conventions for compounds in modern Indian Languages. In this paper, Sanskrit compounding system is examined thoroughly and the insight gained from the Sanskrit grammar is applied for the analysis of compounds in Hindi and Marathi. It is interesting to note that compounding in Hindi deviates from that in Sanskrit in two aspects. The data analysed for Hindi does not contain any instance of Bahuvrihi (exo-centric) compound. Second, Hindi data presents many cases where quite a lot of compounds require a verb as well as vibhakti(a case marker) for its paraphrasing. Compounds requiring a verb for paraphrasing are termed as madhyama-pada-lopi in Sanskrit, and they are found to be rare in Sanskrit. © 2012 The COLING.
  • Item
    The knowledge structure in Amarakośa
    ( 2010-12-01) Nair, Sivaja S. ; Kulkarni, Amba
    Amarakośa is the most celebrated and authoritative ancient thesaurus of Sanskrit. It is one of the books which an Indian child learning through Indian traditional educational system memorizes as early as his first year of formal learning. Though it appears as a linear list of words, close inspection of it shows a rich organisation of words expressing various relations a word bears with other words. Thus when a child studies Amarakośa further, the linear list of words unfolds into a knowledge web. In this paper we describe our effort to make the implicit knowledge in Amarakośa explicit. A model for storing such structure is discussed and a web tool is described that answers the queries by reconstructing the links among words from the structured tables dynamically. © 2010 Springer-Verlag Berlin Heidelberg.
  • Item
    Vibhakti divergence between Sanskrit and Hindi
    ( 2010-12-01) Shukla, Preeti ; Shukl, Devanand ; Kulkarni, Amba
    Translation divergence at various levels between languages arises due to the different conventions followed by different languages for coding the information of grammatical relations. Though Sanskrit and Hindi belong to the same Indo-Aryan family and structurally as well as lexically Hindi inherits a lot from Sanskrit, yet divergences are observed at the level of function words such as vibhaktis. Pānini in his Astādhyāyī has assigned a default vibhakti to kārakas alongwith many scopes for exceptions. He handles these exceptions either by imposing a new kāraka role or by assigning a special vibhakti. However, these methods are not acceptable in Hindi in toto. Based on the nature of deviation, we propose seven cases of divergences in this paper. © 2010 Springer-Verlag Berlin Heidelberg.