Node-Match Tool

preprint OA: closed CC-BY-4.0
🔓 Open OA copy View at publisher

Abstract

We present a tool Node-Match that can do ontology matching using node ranking over graphical representation of the ontologies. Simple ontology matching algorithms are based on lexical measures that only consider text similarity. Taking the shape and structure of the ontology into account while matching can lead to better results [1, 2, 3]. Node-Match illustrates the difference between the two approaches. It is based on S-Match [4] an open source toolkit for lightweight ontology matching and alignment. S-Match supports a rich GUI for designing lightweight ontologies and several ontology alignment algorithms. We use the Department Ontology from the running example in [1] to show the difference between difference ontology matching algorithms.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-29T02:00:03.542394+00:00
License: CC-BY-4.0