All four methods line up two words sound by sound and ask how much of one you would have to change to get the other. They differ in what a change costs and in how they treat chance resemblance. Every score on this page uses PPW unless you pick another method on the Similarity Web or Similarity Matrix tabs.
PPW · phonetic penalised weighted · default
Count sound changes, then drop weak matches
PPW starts from the phonetic weighted score of each word pair (next card). If a pair is at least 50% similar, it counts in full. If it is below 50%, the two words probably do not share an ancestor and only resemble each other by accident, so PPW scores it 0. The language score is the plain average over the 40 words, so it effectively measures how many basic words two languages share and how closely those shared words match.
History
PPW was designed for this project. It borrows an idea from automatic cognate detection, where a computer decides whether two words come from the same ancestor word: pairs below a similarity cut-off are treated as unrelated. PPW applies that cut-off directly, and it replaces a separate chance correction: accidental look-alikes almost never reach 50%, so they simply drop out.
The maths
sw = phonetic weighted similarity of word w
f(s) = s if s ≥ 0.5
f(s) = 0 if s < 0.5
PPW = (1/n) · Σw f(sw) over the n shared concepts
person: Czech osoba vs Slovak tʃlovek
weighted 40%, below 50% → counts 0%
bone: kost vs kosc 85% → counts 85%
Read about cognates on Wikipedia →
Phonetic weighted
Edits that know which sounds are related
Like Levenshtein, but each change has a price that depends on the sounds involved. Swapping a sound for a close cousin (p and b, t and d, s and š) costs a quarter or 60% of a full change, a vowel for another vowel costs 40%, and dropping a vowel or h is cheaper than dropping a consonant. Languages drift along exactly these paths, so related words stay close. Finally the score is corrected for chance: it is compared with how alike words of different meaning are in the same two languages, and only similarity above that level counts.
History
Edit distances with unequal costs were formalised by Robert Wagner and Michael Fischer in 1974, whose algorithm still computes them. Grouping consonants into classes that readily turn into one another goes back to Aharon Dolgopolsky's sound classes of 1964. The chance correction follows the ASJP team (Wichmann, Holman, Bakker and Brown, 2010).
The maths
D[i,j] = min( D[i−1,j] + del(ai),
D[i,j−1] + del(bj),
D[i−1,j−1] + sub(ai,bj) )
sub: same 0 · same class 0.25 · vowel 0.4 · related class 0.6 · other 1
d = D / max(|a|,|b|)
S = 1 − mean(d same meaning) / mean(d different meaning)
bone: kost vs kosc
t → ts is a related sound: costs 0.6
1 − 0.6 / 4 = 85%
Read about edit distance on Wikipedia →
Levenshtein
Count the edits
The number of single-sound changes (swap one sound, add one, remove one) needed to turn one word into the other, divided by the length of the longer word. Every change costs the same, and nothing is subtracted for chance, so even unrelated languages score 10% or more.
History
Soviet mathematician Vladimir Levenshtein defined the measure in 1965 while studying codes that correct transmission errors. Brett Kessler first used it to compare dialects in 1995, measuring Irish Gaelic, and the ASJP project has used it on the world's languages since about 2008.
The maths
D[i,j] = min( D[i−1,j] + 1,
D[i,j−1] + 1,
D[i−1,j−1] + [ai ≠ bj] )
similarity = 1 − D / max(|a|,|b|)
language score = mean over the 40 words
bone: kost → kosc
1 swap out of 4 sounds
1 − 1/4 = 75%
Read about Levenshtein distance on Wikipedia →
Jaro-Winkler
Shared letters, bonus for the start
Counts the sounds two words share in roughly the same position, penalises shared sounds that appear in swapped order, and adds a bonus when the words begin the same way. It was built to catch typing errors in names, so it is generous with short, unrelated words.
History
Matthew Jaro of the US Census Bureau introduced the measure in 1989 for record linkage, matching names across records of the 1985 census of Tampa, Florida. William Winkler added the bonus for a shared beginning in 1990.
The maths
m = sounds matching within ⌊max(|a|,|b|)/2⌋ − 1 positions
t = half the matched sounds out of order
J = ⅓ · ( m/|a| + m/|b| + (m − t)/m )
JW = J + ℓ · 0.1 · (1 − J), ℓ = shared start, at most 4
bone: kost vs kosc = 88%
English vs Japanese overall: 33%,
though the two are unrelated
Read about Jaro-Winkler on Wikipedia →