2004 SmatchAnAlgAndAnImpOfSemMatching
- (Giunchiglia et al., 2004) ⇒ Fausto Giunchiglia, Pavel Shvaiko, and Mikalai Yatskevich. (2004). “Smatch: An algorithm and an implementation of semantic matching.” In: Proceedings of the First European Semantic Web Symposium (ESWS 2004). doi:10.1007/b97867
Subject Headings: Relational Record Coreference Resolution Algorithm, Ontology Concept Coreference Resolution.
Notes
- Presentation: http://www.dit.unitn.it/~accord/Presentations/S-Match_ESWS.ppt
- It uses semantics for matching knowledge representation structures.
- It defines Match as a Function from two graph-line structures and produces mappings among the nodes that correspond semantically to each other.
- It is mainly based on the node labels
- It makes use of WordNet.
- Its graph structure is restricted to a tree.
Cited by
Quotes
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.
,
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 2004 SmatchAnAlgAndAnImpOfSemMatching | Fausto Giunchiglia Mikalai Yatskevich Pavel Shvaiko | Smatch: An algorithm and an implementation of semantic matching | http://dx.doi.org/10.1007/b97867 | 10.1007/b97867 | 2004 |