S-Match: An Algorithm and an Implementation of Semantic Matching
, , and .
Proceedings of the 1st European Semantic Web Symposium, volume 3053 of Lecture Notes in Computer Science, page 61--75. Berlin, Heidelberg, Springer, (May 2004)

We think of Match as an operator which takes two graph-like structures (e.g., conceptual hierarchies or ontologies) and produces a mapping between those nodes of the two graphs that correspond semantically to each other. Semantic matching is a novel approach where semantic correspondences are discovered by computing, and returning as a result, the semantic information implicitly or explicitly codified in the labels of nodes and arcs. In this paper we present an algorithm implementing semantic matching, and we discuss its implementation within the S-Match system. We also test S-Match against three state of the art matching systems. The results, though preliminary, look promising, in particular for what concerns precision and recall.
  • @asalber
  • @gergie
  • @mchaves
  • @dblp
  • @dbenz
  • @thau
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).