S-Match: an algorithm and an implementation of semantic matching

Giunchiglia, Fausto and Shvaiko, Pavel and Yatskevich, Mikalai (2004) S-Match: an algorithm and an implementation of semantic matching. UNSPECIFIED. (In Press)

[img]
Preview
PDF
Download (620Kb) | Preview

    Abstract

    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.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA076 Computer software
    Q Science > QA Mathematics > QA076 Computer software > QA076.7 Programming Languages - Semantics
    Additional Information: In Proceedings of the European Semantic Web Symposium, LNCS 3053, pp. 61-75, 2004.
    Report Number: DIT-04-015
    Repository staff approval on: 15 Dec 2004

    Actions (login required)

    View Item