A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing - Computer Science > Computation and LanguageReportar como inadecuado




A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing - Computer Science > Computation and Language - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Automated language processing is central to the drive to enable facilitatedreferencing of increasingly available Sanskrit E texts. The first step towardsprocessing Sanskrit text involves the handling of Sanskrit compound words thatare an integral part of Sanskrit texts. This firstly necessitates theprocessing of euphonic conjunctions or sandhis, which are points in words orbetween words, at which adjacent letters coalesce and transform. The ancientSanskrit grammarian Panini-s codification of the Sanskrit grammar is theaccepted authority in the subject. His famed sutras or aphorisms, numberingapproximately four thousand, tersely, precisely and comprehensively codify therules of the grammar, including all the rules pertaining to sandhis. This workpresents a fresh new approach to processing sandhis in terms of a computationalschema. This new computational model is based on Panini-s complex codificationof the rules of grammar. The model has simple beginnings and is yet powerful,comprehensive and computationally lean.



Autor: N. Rama, Meenakshi Lakshmanan

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados