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

Locoro, A., Mascardi, V. (2009). A correspondence repair algorithm based on word sense disambiguation and upper ontologies. In KEOD 2009 - 1st International Conference on Knowledge Engineering and Ontology Development, Proceedings (pp.239-246).

A correspondence repair algorithm based on word sense disambiguation and upper ontologies

LOCORO, ANGELA
;
2009

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
paper
Correspondences repair; Ontology matching; Upper ontologies; Word sense disambiguation; Computer Science Applications1707 Computer Vision and Pattern Recognition; Information Systems
English
International Conference on Knowledge Engineering and Ontology Development, KEOD 6 - 8 October
2009
KEOD 2009 - 1st International Conference on Knowledge Engineering and Ontology Development, Proceedings
978-989674012-2
2009
239
246
none
Locoro, A., Mascardi, V. (2009). A correspondence repair algorithm based on word sense disambiguation and upper ontologies. In KEOD 2009 - 1st International Conference on Knowledge Engineering and Ontology Development, Proceedings (pp.239-246).
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/136679
Citazioni
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 0
Social impact