Jaro-Winkler Distance

The Jaro-Winkler distance is a refinement of the Jaro distance that weights common prefixes, making it better suited for matching short strings such as person names where prefixes matter.

Purpose

Provides prefix-sensitive string similarity for fuzzy matching of person names and short text.

Mechanism

The Jaro distance accounts for the number of matching characters and transpositions. Jaro-Winkler = Jaro + l×p×(1-Jaro), where l is the common prefix length (≤4) and p is the prefix weight (usually 0.1). Output ranges from 0 (completely different) to 1 (identical).

Use cases

Person name and address matching
Record linkage
Spelling correction
Deduplication

Examples

Input
```
MARTHA vs MARHTA
```
Output
```
0.961
```
High similarity

Common errors

Using Jaro-Winkler on long strings (prefix weighting loses significance): Use Levenshtein or cosine similarity for long strings

Related terms

Levenshtein Distance

The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions needed to make two strings identical.

Hamming Distance

The Hamming distance is the number of positions at which corresponding characters differ between two equal-length strings; it only applies to equal-length comparisons.

Fuzzy search is a search technique tolerant of spelling variations, matching approximate results based on edit distance, n-grams, or phonetic algorithms.

Related tools

Hamming Distance

Hamming Distance — pure client-side tool. Privacy-first, no server round-trip.

References