摘要
根据字词检索中字词的相关性,提出了一种可以高效的进行字词检索,并且所占用的空间大大缩小的存贮结构。此结构中,字词环环相扣,故取名为字词连环图。文章首先描述了字词连环图的数据结构,然后阐述其构造规则并对其性能进行分析论证。最后给出了其结构的Java实现。我们在PentiumⅢ600内存128M的计算机上进行测试,实验表明,将其应用到我们所设计的印刷体汉字识别系统中,每千字的平均识别时间仅增加了约1.7秒。
Base on the relationship of Chinese words, the author proposed a type of structure of Word Base, which can make the searching of Chinese word width high speed and lessen the space the storage, in this structure, because of the feature that Chinese word is end to end, the Author named it as Interlink Charword Graph. In this paper, the author firstly describes the structure of Interlink Charword Graph, and secondly lists the regulation of construction and analyzes its performance. In the end, the Interlink Charword Graph is implemented with java language. The experimental results demonstrated that the additional time of the recognition per one thousand Chinese words is about 1.7 second.
出处
《微电子学与计算机》
CSCD
北大核心
2006年第12期157-160,共4页
Microelectronics & Computer
关键词
字词库
字词连环图
Word base, Interlink charword graph
