Approximate Matching
Approximate Matching is a matching methodology that belongs to the class of variable alignment techniques, differing from exact matching by permitting controlled discrepancies between values or representations to establish correspondences under partial similarity.
425
Publications
22.7K
Citations
1K
Authors
419
Institutions
Publications per year
2017–2026
67
Variants
Fuzzy Matching
Parents
425
Algorithms for approximate string matching
Esko Ukkonen · Information and Control · 1985 · 621 citations
1–5 of 425
1K
14
h-index
11
h-index
7
h-index
6
h-index
6
h-index
1–5 of 1K
419
University of Chile
Santiago, Chile
17 h-index
24 publications
1.8K citations

Bar-Ilan University
Ramat Gan, Israel
13 h-index
51 publications
1.8K citations
University of Arizona
Tucson, United States
11 h-index
21 publications
1.7K citations

Tel Aviv University
Tel Aviv, Israel
10 h-index
13 publications
1.3K citations

University of Helsinki
Helsinki, Finland
8 h-index
11 publications
1.5K citations
Boston University
Boston, United States
8 h-index
17 publications
891 citations
Purdue University West Lafayette
West Lafayette, United States
8 h-index
15 publications
1.8K citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
10 publications
413 citations
1–8 of 419
14 publications · 762 citations
12
h-index
12 publications · 1.1K citations
11
h-index
8 publications · 401 citations
8
h-index
7 publications · 200 citations
7
h-index
7 publications · 302 citations
7
h-index
1–5