?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=A+New+Computational+Schema+for+Euphonic+Conjunctions+in+Sanskrit+Processing&rft.creator=N.+%2C+Rama+&rft.creator=LAKSHMANAN%2C+Meenakshi+&rft.subject=Language&rft.description=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+sandhi-s%2C+which+are+points+in+words+or+between+words%2C+at+which+adjacent+letters+coalesce+and+transform.+The+ancient+Sanskrit+grammarian+P%3F%3Fini%E2%80%99s+codification+of+the+Sanskrit+grammar+is+the+accepted+authority+in+the+subject.+His+famed+s%3Ftra-s+or+aphorisms%2C+numbering+approximately+four+thousand%2C+tersely%2C+precisely+and+comprehensively+codify+the+rules+of+the+grammar%2C+including+all+the+rules+pertaining+to+sandhi-s.+This+work+presents+a+fresh+new+approach+to+processing+sandhi-s+in+terms+of+a+computational+schema.+This+new+computational+model+is+based+on+P%3F%3Fini%E2%80%99s+complex+codification+of+the+rules+of+grammar.+The+model+has+simple+beginnings+and+is+yet+powerful%2C+comprehensive+and+computationally+lean.&rft.publisher=International+Journal+of+Computer+Science+Issues%2C+IJCSI&rft.date=2009-10&rft.type=Journal+(Paginated)&rft.type=PeerReviewed&rft.format=application%2Fpdf&rft.identifier=http%3A%2F%2Fcogprints.org%2F6725%2F1%2FIJCSI-5-43-51.pdf&rft.identifier=++N.+%2C+Rama++and+LAKSHMANAN%2C+Meenakshi+++(2009)+A+New+Computational+Schema+for+Euphonic+Conjunctions+in+Sanskrit+Processing.++%5BJournal+(Paginated)%5D+++++&rft.relation=http%3A%2F%2Fcogprints.org%2F6725%2F