A traditional-ordered Tibetan dictionary based on present Tibetan coded character sets (ISO/IEC 10646-1:1993 & GB16959-1997) is of hashing structure, and can make no effective index work because of lacking of orde...A traditional-ordered Tibetan dictionary based on present Tibetan coded character sets (ISO/IEC 10646-1:1993 & GB16959-1997) is of hashing structure, and can make no effective index work because of lacking of ordered internal coded character within computers. This paper establishes a transformational relationship between Tibetan letters and numerical codes with the supplement of analyzing the constructional rules of Tibetan words. According to the statistical analysis of syllabic distribution in a large Tibetan dictionary, we design a multi-level index optimizing project for dictionary data retrieval. The core content includes the idea of layer upon layer processing to the letters of basic consonants and vowels and the matching method based on code prefixes of words. At last we propose a concept of 揵ucket?to process the homographs encountered in data retrieval.展开更多
基金湖南省教育厅科学研究基金资助项目(the Research Project of Department of Education of Hunan ProvinceChina under Grant No.05C247)湖南省自然科学基金(the Natural Science Foundation of Hunan Province of China under Grant No.03JJY3102)
文摘A traditional-ordered Tibetan dictionary based on present Tibetan coded character sets (ISO/IEC 10646-1:1993 & GB16959-1997) is of hashing structure, and can make no effective index work because of lacking of ordered internal coded character within computers. This paper establishes a transformational relationship between Tibetan letters and numerical codes with the supplement of analyzing the constructional rules of Tibetan words. According to the statistical analysis of syllabic distribution in a large Tibetan dictionary, we design a multi-level index optimizing project for dictionary data retrieval. The core content includes the idea of layer upon layer processing to the letters of basic consonants and vowels and the matching method based on code prefixes of words. At last we propose a concept of 揵ucket?to process the homographs encountered in data retrieval.
