The intensional semantic conceptual graph matching algorithm based on conceptual sub-graph weight self-adjustment Online publication date: Wed, 31-Jan-2018
by Zeng Hui; Xiong Liyan; Chen Jianjun
International Journal of Computational Science and Engineering (IJCSE), Vol. 16, No. 1, 2018
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook