with each of them. We followed two different approaches to segment a Sanskrit text using sandhi1 rules extracted from a parallel corpus of manually sandhi split text. While the first approach augments the finite state transducer used to analyze Sanskrit morphology and traverse it to segment a word

We propose a methodology for Sanskrit processing by computer. The first layer of this software, which analyses the linear structure of a Sanskrit sentence as a set of possible interpretations under sandhi analysis, is operational. Each interpretation proposes a segmentation of the sentence as a

relation R over the candidate sentence w in order to produce a finite sequence w1, w2,...wn of word forms, together with a proof that w ∈ R(w1 ·w2...· wn). The word forms wi must be justified being valid word forms of Sanskrit (i.e. padas), and some justification must be offered that the combination

, we argue, necessitates the introduction of a sandhi splitting stage in the generic annotation pipeline currently being followed for the treebanking of Indian languages. We identify one type of external sandhi widely occurring in the previous version of the Telugu treebank (version 0.2) and manually

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

Abstract—Splitting is a conventional process in most of Indian languages according to their grammar rules. It is called ‘pada vicchEdanam ’ (a Sanskrit term for word splitting) and is widely used by most of the Indian languages. Splitting plays a key role in Machine Translation (MT) particularly

The rendering of Sanskrit poetry from text to speech is a problem that has not been solved before. One reason may be the complications in the language itself. We present unique algorithms based on extensive empirical analysis, to synthesize speech from a given text input of Sanskrit verses. Using a

and completeness are formally proved. An application to the segmentation of Sanskrit by sandhi analysis is demonstrated. Dedicated to Rod Burstall on the occasion of his 65th birthday

are often repeated as they are or are converted into other vowels or consonants. This paper describes issues involved in vowel based splitting of a Telugu bigram into proper root words using Telugu grammar conjunction (‘sandhi’) rules for MT. Keywords—Telugu word splitting; vowel based splitting; compound

Net. The Samāsa-Kartā can be used for various applications viz., compound cate-gorization, sandhi creation, morphological analysis, paraphrasing, synset creation, etc. 1