DagSemProc.04391.18.pdf
- Filesize: 158 kB
- 4 pages
Document
S-Match: an algorithm and an implementation of semantic matching
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 4391
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2005-03-23
Cite AsGet BibTex
Fausto Giunchiglia, Pavel Shvaiko, and Mikalai Yatskevich. S-Match: an algorithm and an implementation of semantic matching. In Semantic Interoperability and Integration. Dagstuhl Seminar Proceedings, Volume 4391, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.04391.18
https://doi.org/10.4230/DagSemProc.04391.18
Abstract
We think of Match as an operator which takes two graph-like structures 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.
Keywords
- context
- mappings between ontologies
- automatic discovery of mappings
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads