A CORRESPONDENCE REPAIR ALGORITHM BASED ON WORD SENSE DISAMBIGUATION AND UPPER ONTOLOGIES

In an ideal world, an ontology matching algorithm should return all the correct correspondences (it should be complete) and should return no wrong correspondences (it should be correct). In the real world, no implemented ontology matching algorithm is both correct and complete. For this reason, repairing wrong correspondences in an ontology alignment is a very pressing need to obtain more accurate alignments. This paper discusses an automatic correspondence repair method that exploits both upper ontologies to provide informative context to concepts c is an element of o and c' is an element of o' belonging to an alignment a, and a context-based word sense disambiguation algorithm to assign c and c' their correct meaning. This meaning is used to decide whether c and c' are related, and to either keep or discard the correspondence <c, c'>is an element of a, namely, to repair a. The experiments carried on are presented and the obtained results are provided. The advantages of the approach we propose are confirmed by a total average gain of 11,5% in precision for the alignments repaired against a 2% total average error.