一种处理元音连词的二进制模式和计算算法
A Binary Schema and Computational Algorithms to Process Vowel-based Euphonic Conjunctions for Word Searches
摘要:
梵语电子文本中词语的综合检索是一个重要的问题,因为词语在不同的语境中会发生变化。一种这样的语境是连读变调或悦耳的连词,它会导致一个单词由于相邻字母或单词的存在而发生变化。这些可能的连词所造成的变化在梵语中是如此重要,以至于仅仅以给定的形式简单地搜索这个词就可以大大降低搜索的成功率。这项工作提出了一个代表性的模式,表示字母的二进制格式,并减少了Paninian规则的悦耳的连词简单的位设置-取消设置操作。工作提出了一个有效的算法来处理基于元音的sandhis使用此模式。它还提出了另一种算法,使用连读变调处理器来生成给定单词的可能的变换后的单词形式,以用于全面的单词搜索。
英文摘要:
Comprehensively searching for words in Sanskrit E-text is a non-trivial problem because words could change their forms in different contexts. One such context is sandhi or euphonic conjunctions, which cause a word to change owing to the presence of adjacent letters or words. The change wrought by these possible conjunctions can be so significant in Sanskrit that a simple search for the word in its given form alone can significantly reduce the success level of the search. This work presents a representational schema that represents letters in a binary format and reduces Paninian rules of euphonic conjunctions to simple bit set-unset operations. The work presents an efficient algorithm to process vowel-based sandhis using this schema. It further presents another algorithm that uses the sandhi processor to generate the possible transformed word forms of a given word to use in a comprehensive word search.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。