Matching with Transformers in MELT
Sven Hertling, Jan Portisch, Heiko Paulheim

TL;DR
This paper explores the use of transformer-based models for ontology and knowledge graph matching, framing it as a classification task, and provides a practical implementation within the MELT framework that improves matching accuracy.
Contribution
It introduces transformer-based approaches for ontology matching, modeling the task as classification, and offers an accessible implementation in the MELT framework.
Findings
Transformer models improve matching accuracy over traditional methods.
A transformer-based filter effectively selects correct correspondences.
Simple post-processing yields strong alignment results.
Abstract
One of the strongest signals for automated matching of ontologies and knowledge graphs are the textual descriptions of the concepts. The methods that are typically applied (such as character- or token-based comparisons) are relatively simple, and therefore do not capture the actual meaning of the texts. With the rise of transformer-based language models, text comparison based on meaning (rather than lexical features) is possible. In this paper, we model the ontology matching task as classification problem and present approaches based on transformer models. We further provide an easy to use implementation in the MELT framework which is suited for ontology and knowledge graph matching. We show that a transformer-based filter helps to choose the correct correspondences given a high-recall alignment and already achieves a good result with simple alignment post-processing methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Parallel Computing and Optimization Techniques · Neural Networks and Applications
