Jaro–Winkler distance

In computer science and statistics, the Jaro–Winkler similarity is a string metric measuring an edit distance between two sequences. It is a variant of the Jaro distance metric (1989, Matthew A. Jaro) proposed in 1990 by William E. Winkler.

The Jaro–Winkler distance uses a prefix scale $$p$$ which gives more favourable ratings to strings that match from the beginning for a set prefix length $$\ell$$.

The higher the Jaro–Winkler distance for two strings is, the less similar the strings are. The score is normalized such that 0 means an exact match and 1 means there is no similarity. The original paper actually defined the metric in terms of similarity, so the distance is defined as the inversion of that value (distance = 1 − similarity).

Although often referred to as a distance metric, the Jaro–Winkler distance is not a metric in the mathematical sense of that term because it does not obey the triangle inequality.

Jaro similarity
The Jaro similarity $$sim_j$$ of two given strings $$s_1$$ and $$s_2$$ is


 * $$sim_j = \left\{

\begin{array}{l l} 0 & \text{if }m = 0\\ \frac{1}{3}\left(\frac{m}{|s_1|} + \frac{m}{|s_2|} + \frac{m-t}{m}\right) & \text{otherwise} \end{array} \right.$$

Where:


 * $$|s_i|$$ is the length of the string $$s_i$$;
 * $$m$$ is the number of matching characters (see below);
 * $$t$$ is the number of transpositions (see below).

Jaro similarity score is 0 if the strings do not match at all, and 1 if they are an exact match. In the first step, each character of $$s_1$$ is compared with all its matching characters in $$s_2$$. Two characters from $$s_1$$ and $$s_2$$ respectively, are considered matching only if they are the same and not farther than $$\left\lfloor\frac{\max(|s_1|,|s_2|)}{2}\right\rfloor-1$$ characters apart. For example, the following two nine character long strings, FAREMVIEL and FARMVILLE, have 8 matching characters. 'F', 'A' and 'R' are in the same position in both strings. Also 'M', 'V', 'I', 'E' and 'L' are within three (result of $$\lfloor\tfrac{\max(9, 9)}{2}\rfloor - 1$$) characters away. If no matching characters are found then the strings are not similar and the algorithm terminates by returning Jaro similarity score 0.

If non-zero matching characters are found, the next step is to find the number of transpositions. Transposition is the number of matching characters that are not in the right order divided by two. In the above example between FAREMVIEL and FARMVILLE, 'E' and 'L' are the matching characters that are not in the right order. So the number of transposition is one.

Finally, plugging in the number of matching characters $$m$$ and number of transpositions $$t$$ the Jaro similarity of FAREMVIEL and FARMVILLE can be calculated, $$\frac{1}{3}\left(\frac{8}{9} + \frac{8}{9} + \frac{8-1}{8} \right) = 0.88$$

Jaro–Winkler similarity
Jaro–Winkler similarity uses a prefix scale $$p$$ which gives more favorable ratings to strings that match from the beginning for a set prefix length $$\ell$$. Given two strings $$s_1$$ and $$s_2$$, their Jaro–Winkler similarity $$sim_w$$ is:


 * $$sim_w = sim_j + \ell p (1 - sim_j),$$

where:
 * $$sim_j$$ is the Jaro similarity for strings $$s_1$$ and $$s_2$$
 * $$\ell$$ is the length of common prefix at the start of the string up to a maximum of 4 characters
 * $$p$$ is a constant scaling factor for how much the score is adjusted upwards for having common prefixes. $$p$$ should not exceed 0.25 (i.e. 1/4, with 4 being the maximum length of the prefix being considered), otherwise the similarity could become larger than 1. The standard value for this constant in Winkler's work is $$p = 0.1$$

The Jaro–Winkler distance $$d_w$$ is defined as $$d_w = 1 - sim_w$$.

Although often referred to as a distance metric, the Jaro–Winkler distance is not a metric in the mathematical sense of that term because it does not obey the triangle inequality. The Jaro–Winkler distance also does not satisfy the identity axiom $$ d(x,y)=0 \leftrightarrow x = y$$.

Relationship with other edit distance metrics
There are other popular measures of edit distance, which are calculated using a different set of allowable edit operations. For instance, Edit distance is usually defined as a parameterizable metric calculated with a specific set of allowed edit operations, and each operation is assigned a cost (possibly infinite). This is further generalized by DNA sequence alignment algorithms such as the Smith–Waterman algorithm, which make an operation's cost depend on where it is applied.
 * the Levenshtein distance allows deletion, insertion and substitution;
 * the Damerau–Levenshtein distance allows insertion, deletion, substitution, and the transposition of two adjacent characters;
 * the longest common subsequence (LCS) distance allows only insertion and deletion, not substitution;
 * the Hamming distance allows only substitution, hence, it only applies to strings of the same length.