arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.0894cs.CL
收藏

梵语处理中一种新的连词计算模式

A New Computational Schema for Euphonic Conjunctions in Sanskrit Processing

Presidency College(总统学院);Meenakshi College for Women(米纳克希女子学院);Mother Teresa Women’s University(特蕾莎修女女子大学)

N. Rama, Meenakshi Lakshmanan

摘要:

自动化语言处理是驱动器的核心,以使越来越多的可用梵语E文本的参考更加方便。处理梵语文本的第一步涉及梵语复合词的处理,这些复合词是梵语文本的一个组成部分。这首先需要处理悦耳的连词或连读音,连读音是单词中或单词之间的点,相邻的字母在此合并和转换。古代梵语语法学家帕尼尼对梵语语法的编纂是这一学科公认的权威。他著名的佛经或警句,数量约四千,简洁,精确和全面编纂的语法规则,包括所有规则有关的sandhis。这项工作提出了一种新的方法来处理sandhis的计算模式。这种新的计算模型是基于帕尼尼的复杂编纂的语法规则。该模型具有简单的开始,但功能强大,全面和计算精益。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑