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 may either preserve or change identity. This paper investigates whether domain-specific triplet fine-tuning can adapt pretrained embedding models for identity-sensitive retrieval. A synthetic dataset of business and person records was created with identity-preserving variations and challenging non-matching examples. Two widely used embedding models were evaluated before and after fine-tuning using a margin-based similarity evaluation. The results show substantial improvements in separating true matches from highly similar non-matches, demonstrating that domain-specific triplet training can effectively reshape general-purpose embedding spaces for entity retrieval. These findings suggest that targeted fine-tuning provides a practical approach for improving embedding models in data quality management and information retrieval applications.
Figures & tables
Split
Business Anchors
Person Anchors
Business Triplets
Person Triplets
Total Triplets
Training
313
300
3,130
3,000
6,130
Validation
100
100
1,000
1,000
2,000
Overall
413
400
4,130
4,000
8,130
Table 1: Dataset summary.
Margin
Interpretation
0.10
Moderate positive–negative separation
0.20
Strong positive–negative separation
0.30
Very strong positive–negative separation
Table 2: Margin interpretation.
Model
Margin 0.30
Margin 0.20
Margin 0.10
BGE Base EN v1.5 (pretrained)
15.25%
41.85%
60.85%
all-MiniLM-L6-v2 (pretrained)
37.85%
49.35%
64.25%
Table 3: Validation performance of pretrained models across score-gap margins.
Model
Margin 0.30
Margin 0.20
Margin 0.10
BGE Base EN v1.5 (pretrained)
15.25%
41.85%
60.85%
BGE Base EN v1.5 (fine-tuned)
92.70%
96.85%
98.60%
all-MiniLM-L6-v2 (pretrained)
37.85%
49.35%
64.25%
all-MiniLM-L6-v2 (fine-tuned)
83.10%
88.95%
93.10%
Table 4: Pretrained and fine-tuned validation performance.
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
Parameter
Value
Training triplets
6,130
Validation triplets
2,000
Learning rate
2×10−5
Training batch size
16
Evaluation batch size
8
Number of epochs
3
Appendix
Table 5: Training configuration.
Model / Entity Type
Avg. Base Gap
Avg. FT Gap
Improvement
all-MiniLM-L6-v2 / Business
0.0349
0.3999
+0.3649
all-MiniLM-L6-v2 / Person
0.0072
0.3511
+0.3439
BAAI/bge-base-en-v1.5 / Business
0.0688
1.2866
+1.2178
BAAI/bge-base-en-v1.5 / Person
0.0749
0.3294
+0.2545
Appendix
Table 6: Average discrimination gap across representative examples.
Matching person names across heterogeneous records is a core challenge in entity resolution, especially within linguistically and culturally complex environments. Variations in naming conventions, inconsistent transliteration across scripts, and frequent data entry errors make it difficult to unify user identities, an essential requirement for Know Your Customer (KYC) compliance. While Large Language Models have shown promise in understanding natural language, they often struggle with the structured ambiguity present in such domain-specific settings. This paper introduces Structure-Guided Entity Resolution (SGER), a novel framework that fine-tunes an LLM through a two-phase curriculum. The model is first trained to parse the grammatical and semantic structure of personal names, then optimized for the downstream task of binary entity matching. We evaluate SGER in the challenging context of Indian identity data, one of the most linguistically diverse and noisy environments globally. SGER achieves 99.02% accuracy and an F1 of 0.994 on a held-out set of 50,000 real-world pairs, outperforming GPT-4o few-shot prompting and single-stage fine-tuning baselines. The system is fully deployed in production at Dream11, the world's largest fantasy sports platform, serving 250M+ users. Our results demonstrate that curriculum-guided training enables robust, high-precision entity resolution in real-world multilingual systems at scale.
Biomedical Entity Linking disambiguates mentions to entities in a knowledge base (KB), making it the cornerstone of information extraction pipelines. While embedding-based models are a popular approach for the task, they suffer from a key limitation. They compress mentions (and entities) into a single vector, forcing the model to average away crucial fine-grained differences. We present BELXTR, a novel embedding model based on the multi-vector (a.k.a. late interaction) architecture, which allows to leverage token-level matching information. BELXTR extends the original XTR model to biomedical entity linking by integrating an existing task-specific training objective and exploring active query expansion. Experiments across ten corpora and five KBs show that BELXTR improves upon current state-of-the-art in half of the corpora with an average improvement of 5pp recall@1. The largest gains are reported on the challenging cross-species gene disambiguation subtask, where BELXTR outperforms an LLM-powered retrieve-and-rerank pipeline and closely approaches a specialized rule-based system. Our results highlight multi-vector models as a practical alternative to hard-to-maintain rule-based systems or in scenarios where LLM-based reranking is too costly as in PubMed-scale mining. The code to reproduce our experiments can be found at: https://github.com/sg-wbi/belxtr.
Entity Matching (EM) is a core operation in the data integration pipeline, where records from different sources are compared to determine whether they refer to the same real-world entity. Recent work has incorporated domain information and low-resource learning techniques to better adapt EM systems to realistic settings. While these approaches have demonstrated strong performance, it remains unclear how they behave under varying data constraints and levels of supervision in practice. In this paper, we investigate a state-of-the-art method for low-resource, domain-aware EM--BEACON--and study how its performance is affected by different algorithmic choices and data availability conditions. We conduct a series of targeted experiments to evaluate these variations, providing deeper insight into the role of distribution alignment and the behavior of the BEACON framework.
Nicholas Pulsone, Gregory Goren, Roee Shraga
Worcester Polytechnic Institute · Worcester, MA · Israel