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

Angela Locoro, Viviana Mascardi

Abstract

Abstract: 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ϵo and c'ϵ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' >ϵ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.

References

  1. Agirre, E. and Edmonds, P. (2007). Word Sense Disambiguation - Algorithms and Applications. Springer.
  2. Banerjee, S. and Pedersen, T. (2002). An adapted Lesk algorithm for word sense disambiguation using WordNet. In Gelbukh, A. F., editor, CICLing 2002, volume 2276 of LNCS, pages 136-145. Springer.
  3. Do, H. H., Melnik, S., and Rahm, E. (2002). Comparison of schema matching evaluations. In Chaudhri, A. B., Jeckle, M., Rahm, E., and Unland, R., editors, NODe 2002, volume 2593 of LNCS, pages 221-237. Springer.
  4. Euzenat, J. and Shvaiko, P. (2007). Ontology Matching. Springer.
  5. Fellbaum, C., editor (1998). WordNet - An Electronic Lexical Database. The MIT Press.
  6. Gangemi, A., Guarino, N., Masolo, C., Oltramari, A., and Schneider, L. (2002). Sweetening ontologies with DOLCE. In Gómez-Pérez, A. and Benjamins, V. R., editors, EKAW 2002, volume 2473 of LNCS, pages 166-181. Springer.
  7. Haeri, S. H., Hariri, B. B., and Abolhassani, H. (2006). Coincidence-based refinement of ontology matching. In SCIS+ISIS 2006.
  8. Lenat, D. and Guha, R. (1990). Building large knowledgebased systems. Addison Wesley.
  9. Lesk, M. (1986). Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone. In SIGDOC 7886, pages 24- 26. ACM.
  10. Lin, F. and Sandkuhl, K. (2008). A survey of exploiting wordnet in ontology matching. In Bramer, M., editor, IFIP AI, volume 276 of IFIP, pages 341-350. Springer.
  11. Mascardi, V., Locoro, A., and Rosso, P. (2009). Automatic ontology matching via upper ontologies: A systematic evaluation. IEEE Trans. Knowl. Data Eng., to appear.
  12. Meilicke, C., Stuckenschmidt, H., and Tamilin, A. (2007). Repairing ontology mappings. In AAAI 2007, pages 1408-1413. AAAI Press.
  13. Meilicke, C., Stuckenschmidt, H., and Tamilin, A. (2008a). Reasoning support for mapping revision. J. Logic and Computation.
  14. Meilicke, C., Völker, J., and Stuckenschmidt, H. (2008b). Learning disjointness for debugging mappings between lightweight ontologies. In Gangemi, A. and Euzenat, J., editors, EKAW, volume 5268 of LNCS, pages 93-108. Springer.
  15. Niles, I. and Pease, A. (2001). Towards a standard upper ontology. In Welty, C. and Smith, B., editors, FOIS 2001, pages 2-9. ACM.
Download


Paper Citation


in Harvard Style

Locoro A. and Mascardi V. (2009). A CORRESPONDENCE REPAIR ALGORITHM BASED ON WORD SENSE DISAMBIGUATION AND UPPER ONTOLOGIES . In Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2009) ISBN 978-989-674-012-2, pages 239-246. DOI: 10.5220/0002302802390246


in Bibtex Style

@conference{keod09,
author={Angela Locoro and Viviana Mascardi},
title={A CORRESPONDENCE REPAIR ALGORITHM BASED ON WORD SENSE DISAMBIGUATION AND UPPER ONTOLOGIES},
booktitle={Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2009)},
year={2009},
pages={239-246},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002302802390246},
isbn={978-989-674-012-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2009)
TI - A CORRESPONDENCE REPAIR ALGORITHM BASED ON WORD SENSE DISAMBIGUATION AND UPPER ONTOLOGIES
SN - 978-989-674-012-2
AU - Locoro A.
AU - Mascardi V.
PY - 2009
SP - 239
EP - 246
DO - 10.5220/0002302802390246