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

基于Paninian系统的词形连词处理算法

Computational Algorithms Based on the Paninian System to Process Euphonic Conjunctions for Word Searches

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

S. V. Kasmir Raja, V. Rajitha, Meenakshi Lakshmanan

摘要:

在梵语电子文本中搜索单词是一个伴随着梵语的特征(如连词或连音连词)所引入的复杂性的问题。在电子文本中,由于连读变调规则的作用,一个词会以变形的形式出现。简单的单词搜索不会产生这些单词的转换形式。此外,在文献中没有搜索引擎可以综合地搜索梵语电子文本中的单词,同时考虑到谐音连词。这项工作提出了一个最佳的二进制表示模式的梵文字母表,以及算法,有效地处理梵语语法的连读变调规则。本文还提出了一种利用连读变调处理算法对电子文本进行综合词检索的算法。

英文摘要:

Searching for words in Sanskrit E-text is a problem that is accompanied by complexities introduced by features of Sanskrit such as euphonic conjunctions or sandhis. A word could occur in an E-text in a transformed form owing to the operation of rules of sandhi. Simple word search would not yield these transformed forms of the word. Further, there is no search engine in the literature that can comprehensively search for words in Sanskrit E-texts taking euphonic conjunctions into account. This work presents an optimal binary representational schema for letters of the Sanskrit alphabet along with algorithms to efficiently process the sandhi rules of Sanskrit grammar. The work further presents an algorithm that uses the sandhi processing algorithm to perform a comprehensive word search on E-text.

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

↑