mlsanityData to 14 Oct 2026

Background Knowledge in Schema Matching: Strategy vs. Data

arXiv 2107.00001 ↗First posted 29 Jun 2021cs.DB cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

The use of external background knowledge can be beneficial for the task of matching schemas or ontologies automatically. In this paper, we exploit six general-purpose knowledge graphs as sources of background knowledge for the matching task. The background sources are evaluated by applying three different exploitation strategies. We find that explicit strategies still outperform latent ones and that the choice of the strategy has a greater impact on the final alignment than the actual background dataset on which the strategy is applied. While we could not identify a universally superior resource, BabelNet achieved consistently good results. Our best matcher configuration with BabelNet performs very competitively when compared to other matching systems even though no dataset-specific optimizations were made.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 5 of its 40 references that are in the map. First posted on arXiv 29 Jun 2021.

Builds on

5 of 40 references.

References · 5

  1. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  2. 2014Distributed Representations of Sentences and Documentscited by 678
  3. 2020RDF2Vec Light -- A Lightweight Approach for Knowledge Graph Embeddingscited by 16
  4. 2020KGvec2go -- Knowledge Graph Embeddings as a Servicecited by 6
  5. 2020Supervised Ontology and Instance Matching with MELTcited by 5

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 1.

3 papers.