Spider: bringing non-equivalence mappings to OAEI
Marta Sabou, Jorge Gracia · 2008
Abstract. With the large majority of existing matching systems focusing on deriving equivalence mappings, OAEI has been primarily focused on assessing such kind of relations. As the field inevitably advances towards the discovery of more complex mappings, the contest will need to reflect such changes as well. In this paper we present Spider, a system that provides alignments containing not only equivalence mappings, but also a variety of different mapping types (namely, subsumption, disjointness and named relations). Our goal is both to get an insight into the functioning of our system and, more importantly, to assess the current support for dealing with non-equivalence mappings in the OAEI contest. We hope that our observations will contribute to further enhance the procedure of the contest. 1 Presentation of the system 1.1 State, purpose, general statement Our purpose was to investigate two concrete issues related to non-equivalence mappings. 1. Do non-equivalence mappings bring a good addition to alignments made up