Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
The Knowledge Engineering Review
Ontology Matching
Computable Models of the Law and ICT: State of the Art and Trends in European Research
Computable Models of the Law
Applied Ontology - Towards a Metaontology for the Biomedical Domain
Semantic matching: algorithms and implementation
Journal on data semantics IX
A string metric for ontology alignment
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Alignment of biomedical ontologies using life science literature
KDLL'06 Proceedings of the 2006 international conference on Knowledge Discovery in Life Science Literature
Hi-index | 0.00 |
Ontologies are increasingly being used to address the problems of heterogeneous data sources. This has in turn often led to the challenge of heterogeneity between ontologies themselves. Semantic Matching has been seen as a potential solution to resolving ambiguities between ontologies . Whilst generic algorithms have proved successful in fields with little domain specific terminology, they have often struggled to be accurate in areas such as medicine which have their own highly specialised terminology. The MedMatch algorithm was initially created to apply semantic matching in the medical domain through the use of a domain specific background resource. This paper compares a domain specific algorithm (MedMatch) against a generic (S-Match) matching technique, before considering if MedMatch can be tailored to work with other background resources. It is concluded that this is possible, raising the prospect of domain specific semantic matching in the future.