A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

International Journal of Computer Science Issues, IJCSI Volume 5, pp43-51, October 2009

Scientific paper

Automated language processing is central to the drive to enable facilitated referencing of increasingly available Sanskrit E texts. The first step towards processing Sanskrit text involves the handling of Sanskrit compound words that are an integral part of Sanskrit texts. This firstly necessitates the processing of euphonic conjunctions or sandhis, which are points in words or between words, at which adjacent letters coalesce and transform. The ancient Sanskrit grammarian Panini's codification of the Sanskrit grammar is the accepted authority in the subject. His famed sutras or aphorisms, numbering approximately four thousand, tersely, precisely and comprehensively codify the rules of the grammar, including all the rules pertaining to sandhis. This work presents a fresh new approach to processing sandhis in terms of a computational schema. This new computational model is based on Panini's complex codification of the rules of grammar. The model has simple beginnings and is yet powerful, comprehensive and computationally lean.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-620851

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.