most citedA Computational Algorithm based on Empirical Analysis, that Composes Sanskrit Poetry

2 citations · 5 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CL2014

Computational Model to Generate Case-Inflected Forms of Masculine Nouns for Word Search in Sanskrit E-Text

S V Kasmir Raja, V Rajitha, Lakshmanan Meenakshi

The problem of word search in Sanskrit is inseparable from complexities that include those caused by euphonic conjunctions and case-inflections. The case-inflectional forms of a no…

cs.CL2014

An Ontology for Comprehensive Tutoring of Euphonic Conjunctions of Sanskrit Grammar

S. V. Kasmir Raja, V. Rajitha, Meenakshi Lakshmanan

Euphonic conjunctions (sandhis) form a very important aspect of Sanskrit morphology and phonology. The traditional and modern methods of studying about euphonic conjunctions in San…

cs.CL2014★ 2 cited

Computational Algorithms Based on the Paninian System to Process Euphonic Conjunctions for Word Searches

S. V. Kasmir Raja, V. Rajitha, Meenakshi Lakshmanan

Searching for words in Sanskrit E-text is a problem that is accompanied by complexities introduced by features of Sanskrit such as euphonic conjunctions or sandhis. A word could oc…

cs.CL2014★ 1 cited

An Algorithm Based on Empirical Methods, for Text-to-Tuneful-Speech Synthesis of Sanskrit Verse

Rama N., Meenakshi Lakshmanan

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 alg…

cs.CL2010★ 2 cited

A Computational Algorithm based on Empirical Analysis, that Composes Sanskrit Poetry

Rama N., Meenakshi Lakshmanan

Poetry-writing in Sanskrit is riddled with problems for even those who know the language well. This is so because the rules that govern Sanskrit prosody are numerous and stringent.…