You can view the full text of this article for free using the link below.

Title: The intensional semantic conceptual graph matching algorithm based on conceptual sub-graph weight self-adjustment

Authors: Zeng Hui; Xiong Liyan; Chen Jianjun

Addresses: School of Information Engineering, East China Jiaotong University, Nan Chang 330013, China ' School of Information Engineering, East China Jiaotong University, Nan Chang 330013, China ' School of Information Engineering, East China Jiaotong University, Nan Chang 330013, China

Abstract: Semantic computing is an important task in the research on natural language processing. On solving the problem of the inaccurate conceptual graph matching, this paper proposes an algorithm to compute the similarity of conceptual graphs, based on conceptual sub-graph weight self-adjustment. The algorithm works by basing itself on the intensional logic model of Chinese concept connotation, using intensional semantic conceptual graph as knowledge representation method and combining itself with the computation method of E-A-V structures. When computing the similarity of conceptual graphs, the algorithm can give the homologous weight to the sub-graph according to the proportion of how much information the sub-graph contains in the whole conceptual graph. Therefore, it can achieve better similarity results, which has also been proved in the experiments of this paper.

Keywords: Chinese semantic analysis; intensional semantic conceptual graph; E-A-V conceptual structures similarity; conceptual sub-graph weight self-adjustment; computational science.

DOI: 10.1504/IJCSE.2018.089577

International Journal of Computational Science and Engineering, 2018 Vol.16 No.1, pp.53 - 62

Available online: 15 Jan 2018 *

Full-text access for editors Access for subscribers Free access Comment on this article