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. © 2012 Authors.

Mascardi, V., Locoro, A. (2012). BOwL: Exploiting Boolean operators and lesk algorithm for linking ontologies. In Proceedings of the ACM Symposium on Applied Computing (pp.398-400) [10.1145/2245276.2245352].

BOwL: Exploiting Boolean operators and lesk algorithm for linking ontologies

LOCORO, ANGELA
Ultimo
2012

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. © 2012 Authors.
paper
ontology matching; ontology tagging; Software
English
27th Annual ACM Symposium on Applied Computing, SAC 2012
2012
Proceedings of the ACM Symposium on Applied Computing
9781450308571
2012
398
400
none
Mascardi, V., Locoro, A. (2012). BOwL: Exploiting Boolean operators and lesk algorithm for linking ontologies. In Proceedings of the ACM Symposium on Applied Computing (pp.398-400) [10.1145/2245276.2245352].
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/136653
Citazioni
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
Social impact