A Matching Algorithm in Semantic Web
Liang Li · Xi'an Jiaotong Daxue xuebao · 2009
A conception rank based algorithm for semantic Web is presented to improve the low efficiency and poor precision of the synonymous words matching algorithm and the string matching algorithm.For an ontology with large amount of conception,the conception structure of the ontology is constructed by the algorithm based on the relationship among conceptions.Then the algorithm calculates the contribution for each conception such that the general conception has low contribution and the special conception has high contribution,and then the contributions are quantified into conception ranks.The resulting conception ranks are used as weights and the weighted linguistically matching degree is used to calculate a new conception matching degree in semantic matching.The new matching degree can improve the accuracy of semantic matching because the structure coefficient is taken into account.Experiments show that the matching degree can be increased by 20% compared with the synonymous words matching algorithm.