Research on the Similarity between Nodes with Hypernymy/Hyponymy Relations based on IC and Taxonomical Structure
|
Xiaogang Zhang College of Information Engineering, Tarim University, China This email address is being protected from spambots. You need JavaScript enabled to view it. |
Lili Sun Science and Technology Office, Tarim University, China This email address is being protected from spambots. You need JavaScript enabled to view it. |
Abstract: The similarity method has an important effect on some tasks of natural language processing, such as information retrieval, automatic translation and named entity recognition. Hypernymy/hyponymy relations are widespread in semantic webs and knowledge graphs, so computing the similarity of hypernymy/hyponymy is a key issue in the text processing field. All measures of both feature-based and IC-based methods have obvious deficiencies. The feature-based method estimated the similarity by the depth of the node, and the IC-based method computed the similarity by the position of the deepest common parent. The deficiency of the feature-based method and IC-based method is that they include one parameter, so the performance is slightly inaccurate and unstable. To address this deficiency, our paper proposed a hybrid method that computes the similarity of hypernymy/hyponymy by a hybrid parameter (dhype(lch)) that implies two parameters: depth of the node and position of the deepest common parent. Compared with several similarity methods, the proposed method achieved better performance in terms of accuracy rate, Pearson correlation coefficient and artificial fitting effect.
Keywords: Computing similarity, information content, ontology and knowledge graph, WordNet, hypernymy/hyponymy.
Received November 16, 2020; accepted August 31, 2021