A new method, Pair INterpretation for Entity matching (PINE), which takes two records as input, and outputs correlated token pairs as an explanation for an entity-matching decision, demonstrating that the extracted token pairs exhibit strong correlations and serve as interpretable evidence for matching records.
Abstract
Explanation techniques such as local interpretable model-agnostic explanation (LIME) provide reasons behind decisions made by machine-learning models. These methods typically use a set of features and their values as inputs and identify those that significantly influence the final decision. However, machine-learning models for entity matching operate on two sets of tokens or records, each representing an entity, to determine whether they refer to the same real-world entity. Explanations for entity-matching decisions are more convincing when they highlight contributing pairs of tokens within the pair of records, rather than focusing on individual tokens alone. In this sense, existing explanation techniques are insufficient for entity matching. Therefore, we propose a new method, Pair INterpretation for Entity matching (PINE), which takes two records as input, and outputs correlated token pairs as an explanation for an entity-matching decision. Our extensive experiments on public datasets demonstrate that the extracted token pairs exhibit strong correlations and serve as interpretable evidence for matching records.
The factors underlying performance differences across matcher architectures are clarified and motivate future research and benchmark designs that better disentangle architectural choices from model-level factors while explicitly evaluating distribution shift and cross-dataset transferability.
This paper introduces a fully graph-based pipeline where the classifier never directly processes the input text, and reveals that graphs and text are complementary: combining both modalities achieves 92.1% accuracy on SNLI.
Younes Boufouss, Luc Pommeret, Thomas Gerald et al.· 0 citations
A novel unsupervised entity alignment framework, named LLM‐Align, is presented to effectively leverage Large Language Models to precisely annotate entity pairs, which alleviates structural heterogeneity between aligned entities.
Zhi-Huan Yan, Yi Wang, Chong-Chong Zhang et al.· Expert systems· 0 citations
General-purpose text embedding models are designed to capture semantic similarity but are not optimised for distinguishing entity records that represent the same real-world business or person. This limitation affects applications such as entity resolution and duplicate record retrieval, where small textual differences...
Khajesh Sapram, S. Raju, Kishore Konda· 0 citations
Results show that iterative preference learning benefits both concise entity prediction and explicit reasoning, and also shows that iterative preference learning benefits both concise entity prediction and explicit reasoning.
Yi-Xin Peng, Kevin (Yu-Teng) Li, Stefan Decker· arXiv.org· 0 citations
A simple, training-free framework in which a reasoning-capable vision-language model iteratively searches and reasons over Wikipedia, gathering evidence dynamically, shows that reasoning and retrieval are complementary on rare entities.
Parinthapat Pengpun, Simran Khanuja, Graham Neubig· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.