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 imple- mented ontology matching algorithm is both correct and complete. For this reason, repairing wrong corre- spondences 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 infor- mative context to concepts c2 o and c 0 2 o 0 belonging to an alignment a, and a context-based word sense disambiguation algorithm to assign c and c 0 their correct meaning. This meaning is used to decide whether c and c 0 are related, and to either keep or discard the correspondence 2 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.

[1]  Michael E. Lesk,et al.  Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone , 1986, SIGDOC '86.

[2]  Lawrence C. Paulson,et al.  Logic And Computation , 1987 .

[3]  Johanna Völker,et al.  Learning Disjointness for Debugging Mappings between Lightweight Ontologies , 2008, EKAW.

[4]  Ted Pedersen,et al.  An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet , 2002, CICLing.

[5]  Heiner Stuckenschmidt,et al.  Repairing Ontology Mappings , 2007, AAAI.

[6]  Christiane Fellbaum,et al.  Book Reviews: WordNet: An Electronic Lexical Database , 1999, CL.

[7]  Eneko Agirre,et al.  Word Sense Disambiguation: Algorithms and Applications , 2007 .

[8]  Nicola Guarino,et al.  Sweetening Ontologies with DOLCE , 2002, EKAW.

[9]  Heiner Stuckenschmidt,et al.  Reasoning Support for Mapping Revision , 2009, J. Log. Comput..

[10]  Adam Pease,et al.  Towards a standard upper ontology , 2001, FOIS.

[11]  Ramanathan V. Guha,et al.  Building large knowledge-based systems , 1989 .

[12]  Kurt Sandkuhl,et al.  A Survey of Exploiting WordNet in Ontology Matching , 2008, IFIP AI.

[13]  Erhard Rahm,et al.  Comparison of Schema Matching Evaluations , 2002, Web, Web-Services, and Database Systems.

[14]  Viviana Mascardi,et al.  Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation , 2010, IEEE Transactions on Knowledge and Data Engineering.

[15]  Babak Bagheri Hariri,et al.  Coincidence-Based Refinement of Ontology Matching , 2006 .