The Sorting Mathematical Model and Algorithm of Written Tibetan Language
The Sorting Mathematical Model and Algorithm of Written Tibetan Language
复制标题
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Jiang Di
中科院分区：
文献类型：
--
作者：
Jiang Di
本文对词的结构、构类的顺序、各结构位置的字符顺序、词的长度和垂直组合堆栈的层次进行了详尽的分析，并建立了排序数学模型。在分析的基础上，对一个词中所有存在的带有数字的字符赋不同的值，然后用特殊的算法逐级识别单词中的每个字符，并与字符-数字列表进行匹配。该处理策略已在Windows 2000/NT操作系统中实现。
According to GB16959-1997 and ISO/IEC 10646-1:1993 of coded character set for Tibetan information processing, there is an engineering need for applying the set to all kinds of software and databases, in which sorting is an important technology. As Tibetan sorting involves construction order, classes of constitution and character sequence in the dictionary order, A Written Tibetan word has an inconceivably complex structure with multi-hierarchies. The paper makes an exhaustive analysis to the structures of words, the order of construction categories, and the sequence of characters in each structural position, as well as the length of words and the hierarchies of vertical composition stacks, and then establishes a sorting mathematical model. On the basis of the analysis, the paper assigns distinctive values to all existing characters with numerals in a word, then step by step identifies each character in the words with special algorithm and match it with character-numeral lists. At last, the paper combines all the values extracted from characters of words and compares different combination to make an ordered arrangement for any words in Tibetan language. This processing strategy has been accomplished in Windows 2000/NT Operating System.