| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jackson (0) - 37 freq jeckson (1) - 1 freq fackson (1) - 1 freq backson (1) - 12 freq jacksie (2) - 3 freq hackston (2) - 14 freq dickson (2) - 12 freq jackman (2) - 2 freq jackson's (2) - 2 freq jameson (2) - 2 freq backson' (2) - 1 freq jackpot (2) - 5 freq jason (2) - 24 freq jacks (2) - 10 freq makk-on (3) - 1 freq clarkson (3) - 3 freq ricksons (3) - 1 freq sanson (3) - 1 freq watson (3) - 46 freq tacksmen (3) - 3 freq packs (3) - 12 freq wackin (3) - 1 freq racklin (3) - 3 freq jimison (3) - 1 freq sackin (3) - 4 freq |
jackson (0) - 37 freq jeckson (1) - 1 freq backson (2) - 12 freq fackson (2) - 1 freq jackman (3) - 2 freq dickson (3) - 12 freq jacksie (3) - 3 freq jacks (3) - 10 freq jocks' (4) - 3 freq jockin (4) - 1 freq jucks (4) - 1 freq jocks (4) - 5 freq jacksies (4) - 2 freq jackson's (4) - 2 freq jackpot (4) - 5 freq jameson (4) - 2 freq backson' (4) - 1 freq jason (4) - 24 freq hackston (4) - 14 freq ackin (5) - 5 freq joackeys (5) - 1 freq mckeon (5) - 1 freq hackin (5) - 7 freq macks (5) - 3 freq sacks (5) - 10 freq |
SoundEx code - J250 joukin - 25 freq jiggin - 37 freq jookin - 7 freq jaggin - 9 freq jokin - 46 freq joggin - 9 freq jackson - 37 freq jizzen - 4 freq jason - 24 freq jeconiah - 4 freq jockina - 20 freq juicin - 2 freq jukin - 1 freq joggan - 1 freq jeckson - 1 freq jessie-annie - 1 freq jakin - 1 freq joukan - 1 freq jycin - 1 freq jui-shiuan - 2 freq jwiszsm - 1 freq jewson - 1 freq jockin - 1 freq jojum - 1 freq jasonm - 1 freq jackieme - 2 freq jojom - 1 freq jecm - 1 freq |
MetaPhone code - JKSN jackson - 37 freq jeckson - 1 freq jxn - 1 freq jgzn - 1 freq |
JACKSON |
| Time to execute Levenshtein function - 0.184365 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.353833 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.032443 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.043533 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001062 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |