Learning to map between ontologies on the semantic web
Proceedings of the 11th international conference on World Wide Web
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
Schema and ontology matching with COMA++
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Measuring semantic similarity in the taxonomy of WordNet
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Word sense disambiguation in queries
Proceedings of the 14th ACM international conference on Information and knowledge management
Word Sense Disambiguation: Algorithms and Applications (Text, Speech and Language Technology)
Word Sense Disambiguation: Algorithms and Applications (Text, Speech and Language Technology)
Ontology Matching
Leveraging data and structure in ontology integration
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Polysemy in controlled natural language texts
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Disambiguating entity references within an ontological model
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Entity reference resolution via spreading activation on RDF-Graphs
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Hi-index | 0.00 |
The recommendable primary step of ontology integration is annotation of ontology components with entries from WordNet or other dictionary sources in order to disambiguate their meaning. This paper presents an approach to automatically disambiguating the meaning of OWL ontology classes by providing sense annotation from WordNet. A class name is disambiguated using the names of the related classes, by comparing the taxonomy of the ontology with the portions of the WordNet taxonomy corresponding to all possible meanings of the class. The equivalence of the taxonomies is expressed by a probability function called affinity function. We apply two different basic techniques to compute the affinity coefficients: one based on semantic similarity calculation and the other on analyzing overlaps between word definitions and hyponyms. A software prototype is provided to evaluate the approach, as well as to determine which of the two disambiguation techniques produces better results.