Topic Maps Matching Computation Based on Composite Matchers

Abstract

In this paper, we propose a multi-strategic matching approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constraints of the Topic Maps. Our multi-strategic matching approach consists of a linguistic module and a Topic Map constraints-based module. A linguistic module computes similarities between concepts using morphological analysis, and language-dependent heuristics. A Topic Map constraints module takes advantage of several Topic Maps-dependent techniques such as a topic property-based matching, a hierarchy-based matching, and an association-based matching. It is not necessary to generate a cross-pair of all topics from the ontologies because unmatched pairs of topics can be removed by characteristics and constraints of the Topic Maps. Our experiments show that the automatically generated matching results conform to the outputs generated manually by domain experts, which is very promising for further work.KeywordsOntology matchingTopic Mapsmulti-strategic matching process