Record linkage, the process of matching records that refer to the same entity across datasets, is essential to empirical social science but remains methodologically underdeveloped. Researchers treat it as a preprocessing step, applying ad hoc rules without quantifying the uncertainty that linkage errors introduce into downstream analyses. Existing methods either achieve low accuracy or require substantial labeled training data. I present EnsembleLink, a method that achieves high accuracy without any training labels. EnsembleLink leverages pre-trained language models that have learned semantic relationships (e.g., that "South Ozone Park" is a neighborhood in "New York City" or that "Lutte ouvriere" refers to the Trotskyist "Workers' Struggle" party) from large text corpora. On benchmarks spanning city names, person names, organizations, multilingual political parties, and bibliographic records, EnsembleLink matches or exceeds methods requiring extensive labeling. The method runs locally on open-source models, requiring no external API calls, and completes typical linkage tasks in minutes.
Figures & tables
Task
Method
Blocking
Accuracy
City Matching
Exact match
—
0.000
fastLink
—
0.713
fuzzylink
—
0.717
EnsembleLink
None
0.901
EnsembleLink
State (Fuzzy)
0.900
Candidate-Voter
Exact match
—
0.000
Table 1: Accuracy across benchmark tasks (40% test split, top-1 matching). Exact match, fastLink, and EnsembleLink require no labels; fuzzylink uses LLM-assisted active learning. Blocking column indicates whether hierarchical blocking was applied (with blocking variable in parentheses).
Task
Query
Matched Reference
City
South Ozone Park, NY
Queens, NY
East Elmhurst, NY
Queens, NY
OKC, OK
Oklahoma City, OK
Newbury Park, CA
Thousand Oaks, CA
Candidate-Voter
Tim Flynn
Timothy Bryant Flynn
Tony Daysog
Anthony Honda Daysog
Table 2: Example matched pairs from each task, drawn from correct predictions. Examples are chosen to maximize string distance between query and reference, demonstrating the method’s ability to handle semantic similarity beyond lexical overlap.
Table 4: Fine-tuning experiments: F1 scores at different label counts, evaluated on held-out pair samples. Fine-tuning provides no consistent improvement over the zero-shot baseline.
Corpus
Embed
Index
Retrieve
Rerank
Total
Acc
5,000
22.0s
2.0s
49.8s
52.3s
132.8s
0.984
10,000
35.5s
3.2s
111.5s
65.2s
221.8s
0.989
20,000
71.2s
7.5s
227.8s
59.2s
372.4s
0.985
40,000
142.7s
13.3s
437.6s
57.9s
658.5s
0.982
64,263
216.8s
19.4s
413.1s
35.3s
729.5s
0.979
Table 5: Scalability on DBLP-Scholar (963 test queries, 40% split)
Method
Training Data
F1
Accuracy
Supervised (thousands of labels)
Ditto ( Li et al., 2020 )
Full training set
94.3
DeepMatcher ( Mudgal et al., 2018 )
Full training set
94.7
RoBERTa fine-tuned
Full training set
93.9
Zero-shot LLMs
GPT-4 ( Peeters et al., 2024 )
None
89.8
Table 6: Comparison with published results on DBLP-Scholar. Published methods use pair-level F1 on candidate pairs. For EnsembleLink, I report both top-1 accuracy and pair-level F1 at three score thresholds τ .
Model
Device
Pairs/sec
ms/pair
Speedup
Jina Reranker v2 Multi (278M)
GPU
748
1.3
30 ×
Jina Reranker v2 Multi (278M)
CPU
25
40
1 ×
MiniLM-L-6 (22M)
GPU
581
1.7
1.2 ×
MiniLM-L-6 (22M)
CPU
478
2.1
1 ×
Table 7: Inference speed comparison: GPU (NVIDIA RTX 4090) vs CPU
Entity resolution links records that refer to the same real-world entity across datasets despite differences in names, attributes, formats, and languages.
Record linkage and demographic inference from names are routine demands in social science. Most approaches to these problems require labeled training data that are difficult or costly to acquire. I show that pre-trained language models perform both tasks accurately without requiring task-specific training. For record linkage, I introduce EnsembleLink, an algorithm that uses pre-trained embeddings alongside string-based scorers to retrieve a short list of candidates and then identify the likeliest matches. EnsembleLink matches or exceeds the performance of most prior approaches while generalizing across scripts and formats that those methods are unable to handle. For ethnicity inference from names, I show that large language models (LLMs) achieve up to 83.8% accuracy on U.S. voter files, compared to 78.0% for name-supplemented BISG. Open-weight models offer reproducible implementations that approach these models in accuracy. Moreover, LLMs are able to infer group membership for religious, caste-based, and other ethnic group categories outside of the United States, and reduce bias in downstream estimates of geographic racial gaps. Where pre-training encodes the world knowledge required by each task, task-specific labels add less information.
Noah Dasanaike
PhD Candidate, Department of Government, Harvard University.
We built and evaluated a self-serve entity resolution (ER) system on six benchmarks spanning 864 to 5M records, and three lessons emerged that are absent from existing ER literature. (1) No single matching algorithm wins everywhere - a self-serve pipeline cannot predict its next dataset, so we recommend training several algorithm families per dataset and letting an automatic bake-off pick the winner. (2) Precision and recall need separate fixes, not a shared threshold - precision needs hard rule-based vetoes, recall needs more diverse candidate retrieval. (3) One false-positive link can silently merge unrelated entities - assuming "A matches B" and "B matches C" implies "A matches C" lets a single bad link chain hundreds of records together, so every cross-group merge must be actively re-verified. We hope these lessons save practitioners the months of dead-end experiments that led us to them.
Multimodal entity linking grounds entity mentions in text and images to knowledge-base entries. These systems degrade on rare entities, but prior work measures rarity primarily through popularity-based metrics such as pageviews. We broaden this view using knowledge-graph structural metrics that capture how well an entity is documented and connected. These metrics identify many rare entities that popularity metrics miss. Across the resulting rare-entity slices, state-of-the-art accuracy drops by 15.4-39.9%, showing that different rarity definitions expose different failure modes. To address these failures, we introduce a simple, training-free framework in which a reasoning-capable vision-language model iteratively searches and reasons over Wikipedia, gathering evidence dynamically. Controlled experiments show that reasoning and retrieval are complementary. Reasoning alone does not significantly improve accuracy on rare entities. Retrieval without reasoning improves rare-entity accuracy but can hurt overall accuracy. Their combination performs best. On MERLIN, a multilingual multimodal entity linking benchmark over five languages (Hindi, Indonesian, Japanese, Tamil, Vietnamese), our best system improves over the state of the art by 6.9% overall and by up to 23.3% on rare-entity slices. We release MERLIN-Rare, rare-entity test slices for targeted evaluation, with our framework.
Parinthapat Pengpun, Simran Khanuja, Graham Neubig