@incollection{giunchiglia2004smatch,
  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.},
  address = {Berlin / Heidelberg},
  affiliation = {Dept. of Information and Communication Technology, University of Trento, 38050 Povo, Trento, Italy},
  author = {Giunchiglia, Fausto and Shvaiko, Pavel and Yatskevich, Mikalai},
  booktitle = {The Semantic Web: Research and Applications},
  doi = {10.1007/978-3-540-25956-5_5},
  editor = {Bussler, Christoph and Davies, John and Fensel, Dieter and Studer, Rudi},
  interhash = {6b38aa96f0a9200c919a96a5873c9e3c},
  intrahash = {c7d77f86497e94b352b6f3279fa70deb},
  pages = {61-75},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {S-Match: an Algorithm and an Implementation of Semantic Matching},
  url = {http://dx.doi.org/10.1007/978-3-540-25956-5_5},
  volume = 3053,
  year = 2004
}