BOwL: exploiting Boolean operators and lesk algorithm for linking ontologies

Authors:
Viviana Mascardi;Angela Locoro
Affiliations:
Università di Genova, Genova, Italy;Università di Genova, Genova, Italy
Venue:
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Year:
2012

Citing 5
Cited 2

Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone

SIGDOC '86 Proceedings of the 5th annual international conference on Systems documentation
An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet

CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
Comparison of Schema Matching Evaluations

Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
AgreementMaker: efficient matching for large real-world schemas and ontologies

Proceedings of the VLDB Endowment
Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation

IEEE Transactions on Knowledge and Data Engineering

CooL-AgentSpeak: Endowing AgentSpeak-DL agents with plan exchange and ontology services

Web Intelligence and Agent Systems
CooL-AgentSpeak: Endowing AgentSpeak-DL agents with plan exchange and ontology services

Web Intelligence and Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

BOwL applies word sense disambiguation techniques for tagging ontology entities with WordNet words. Boolean operators that appear in names of ontology entities are interpreted based on their semantics and are used during the ontology matching stage accordingly. Experimental results are shown, demonstrating the feasibility of the approach.