It's AI Match: A Two-Step Approach for Schema Matching Using Embeddings
Not on the map. Why?
Abstract (arXiv)
Since data is often stored in different sources, it needs to be integrated to gather a global view that is required in order to create value and derive knowledge from it. A critical step in data integration is schema matching which aims to find semantic correspondences between elements of two schemata. In order to reduce the manual effort involved in schema matching, many solutions for the automatic determination of schema correspondences have already been developed. In this paper, we propose a novel end-to-end approach for schema matching based on neural embeddings. The main idea is to use a two-step approach consisting of a table matching step followed by an attribute matching step. In both steps we use embeddings on different levels either representing the whole table or single attributes. Our results show that our approach is able to determine correspondences in a robust and reliable way and compared to traditional schema matching approaches can find non-trivial correspondences.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 10 of its 45 references that are in the map. First posted on arXiv 8 Mar 2022.
Builds on
10 of 45 references.
References · 10
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2018Deep contextualized word representationscited by 2,285
- 2014Distributed Representations of Sentences and Documentscited by 677
- 2018Universal Sentence Encodercited by 485
- 2014SimLex-999: Evaluating Semantic Models with (Genuine) Similarity Estimationcited by 170
- 2017DeepER -- Deep Entity Resolutioncited by 54
- 2016Problems With Evaluation of Word Embeddings Using Word Similarity Taskscited by 25
- 2019Learning Semantic Annotations for Tabular Datacited by 17
- 2019Schema Matching using Machine Learningcited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 1.
4 papers.
- 2024GRAM: Generative Retrieval Augmented Matching of Data Schemas in the Context of Data Securitycited by 4
- 2026RACT: Retrieval Augmented Column-Table Learning and Prediction for Multi-Table Schema Matchingcited by 1
- 2023Features matching using natural language processingcited by 0
- 2024Xling: A Learned Filter Framework for Accelerating High-Dimensional Approximate Similarity Joincited by 0
- 2026RACT: Retrieval Augmented Column-Table Learning and Prediction for Multi-Table Schema Matching5 Jun 2026
- 2024GRAM: Generative Retrieval Augmented Matching of Data Schemas in the Context of Data Security4 Jun 2024
- 2024Xling: A Learned Filter Framework for Accelerating High-Dimensional Approximate Similarity Join20 Feb 2024
- 2023Features matching using natural language processing14 Mar 2023