A fast and compact data structure of storing multi-attribute relations among words

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 separately, 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 leaves. The linkage enables us to share the basic words required for multi-attribute relations. Theoretical observations show that the worst-case time complexity of retrieving multi-attribute relations is a constant. From the simulation results, it is shown that the presented method is about 1/3 smaller than that of the competitive methods