(1) its highly algorithmic grammar, both in terms of morphology and syntax, so much that, by mechanically applying the sutras of Panini or Jiva Goswami to nounal and verbal roots one can form perfectly correct words and sentences without even knowing what they mean; (2) its orderly and systematic yet extremely versatile word formation, which expands a fairly limited number of nounal and verbal roots, with the help of a few prefixes, suffixes, and pronouns, into a practically unlimited range of words and their meanings; and (3) its inflection-based syntax, which makes the overall meaning of a sentence almost independent on the position of its constituent words (unlike English, Hindi, Russian, and many other languages). For instance, the sentence "people see you" changes it meaning entirely if the words are moved around like "you see people ", "see you people", "you people see", while its Sanskit equivalent "janAh pashyanti tvAm" will retain its meaning with any respective placement of the words in it: "janAs tvAm pashyanti", "pashyanti tvAm janAh", "pashyanti janAs tvAm" etc. This may account for the purported unambiguity of the Sanskrit language. A Computational Algorithm based on Empirical Analysis, that Composes Sanskrit Poetry Rama N., Meenakshi Lakshmanan
(Submitted on 7 Mar 2010)
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. We propose a computational algorithm that converts prose given as E-text into poetry in accordance with the metrical rules of Sanskrit prosody, simultaneously taking care to ensure that sandhi or euphonic conjunction, which is compulsory in verse, is handled. The algorithm is considerably speeded up by a novel method of reducing the target search database. The algorithm further gives suggestions to the poet in case what he/she has given as the input prose is impossible to fit into any allowed metrical...
Please join StudyMode to read the full document