| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| atkinson (0) - 1 freq parkinson (2) - 1 freq alpinson (2) - 1 freq taison (3) - 1 freq attintion (3) - 3 freq athins (3) - 2 freq dickinson (3) - 1 freq aitkins (3) - 1 freq athinkin (3) - 1 freq robinson (3) - 22 freq mathieson (3) - 18 freq apinion (3) - 1 freq parkinsons (3) - 2 freq mckinnon (3) - 1 freq pattison (3) - 1 freq kindon (3) - 1 freq mackinnon (3) - 6 freq kitson (3) - 1 freq kinnon (3) - 12 freq addison (3) - 31 freq alison (3) - 410 freq bparkinson (3) - 2 freq watkins (3) - 12 freq ailison (3) - 1 freq 'poison (4) - 1 freq |
atkinson (0) - 1 freq aitkins (4) - 1 freq alpinson (4) - 1 freq parkinson (4) - 1 freq tension (5) - 32 freq kinnon (5) - 12 freq attensien (5) - 1 freq watkins (5) - 12 freq aitkens (5) - 1 freq taakin-an (5) - 1 freq takins (5) - 2 freq tennyson (5) - 1 freq kindon (5) - 1 freq kitson (5) - 1 freq dickinson (5) - 1 freq athins (5) - 2 freq attintion (5) - 3 freq taison (5) - 1 freq athinkin (5) - 1 freq robinson (5) - 22 freq tensin (5) - 1 freq aathins (6) - 3 freq kinn (6) - 4 freq thin-an (6) - 2 freq kinkin (6) - 3 freq |
SoundEx code - A325 addison - 31 freq addison's - 12 freq attackin' - 1 freq attachment - 3 freq aidgin - 1 freq attackin - 8 freq aitken - 32 freq adjoinin - 2 freq ati'sunbems - 1 freq aitken's - 4 freq addisence - 1 freq audiscense - 1 freq autism - 3 freq aitkin - 1 freq atakan - 1 freq attacking - 4 freq aitkens - 1 freq aodsmegh - 1 freq aitkins - 1 freq aitkens - 1 freq adgmbfhvox - 1 freq addishanel - 1 freq atkinson - 1 freq |
MetaPhone code - ATKNSN atkinson - 1 freq |
ATKINSON |
| Time to execute Levenshtein function - 0.202941 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.348042 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.027415 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.037768 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.000950 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. |