A link trie structure of storing multiple attribute relationships for natural language dictionaries
A link trie structure of storing multiple attribute relationships for natural language dictionaries
复制标题
自然语言词典存储多属性关系的链接trie结构
DOI：
10.1080/00207169908804869
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
J. Aoe
中科院分区：
文献类型：
--
作者：
K. Morita;M. Koyama;M. Fuketa;J. Aoe
词关系是一种原始知识，在自然语言处理系统中非常有用。在传统的系统中，虽然每个知识字典都是独立构建的，但最近的自然语言应用通过整合上述多属性关系而变得更加复杂。本文提出了一种有效的数据结构，通过引入一个可以定义它们的叶子之间的链接的树。该链接使我们能够共享多属性关系所需的基本单词。理论观察表明，检索多属性关系的最坏情况时间复杂度是一个常数。仿真结果表明，本文提出的方法比现有的方法要小1/3。
Word relation is primitive knowledge and it is very useful for natural language processing systems. In the traditional systems, although each knowledge dictionary is constructed in separation, recent natural language applications become more complex by integrating the above multi-attribute relationships. This paper presents an efficient data structure by introducing a trie that can define the linkage among their leaves. The linkage enables us to share the basic words required for multi-attribute relationships. Theoretical observations show that the worst-case time complexity of retrieving multi-attribute relationships is a constant. From the simulation results, it is shown that the presented method is 1/3 smaller than the competitive methods.