H-match: an algorithm for dynamically matching ontologies in peer-based systems
Silvana Castano, Alfio Ferrara, Stefano Montanelli · 2003
Abstract. In this paper, we present h-match, an algorithm for dynamically matching distributed ontologies. By exploiting ontology knowledge descriptions, h-match can be used to dynamically perform ontology matching at different levels of depth, with different degrees of flexibility and accuracy. h-match has been developed in the Helios framework, conceived for supporting knowledge sharing and ontology-addressable content retrieval in peer-based systems. 1