| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| addison (0) - 31 freq addition (2) - 17 freq add-on (2) - 1 freq adamson (2) - 1 freq addison's (2) - 12 freq ailison (2) - 1 freq advisor (2) - 10 freq alison (2) - 410 freq addin (2) - 39 freq advisin (2) - 3 freq addan (3) - 3 freq amaisin (3) - 1 freq damson (3) - 1 freq addeition (3) - 3 freq caddis (3) - 1 freq dyson (3) - 1 freq advisors (3) - 3 freq 'poison (3) - 1 freq alpinson (3) - 1 freq garrison (3) - 9 freq aidso (3) - 1 freq arisen (3) - 4 freq danson (3) - 1 freq disown (3) - 4 freq haddin (3) - 15 freq |
addison (0) - 31 freq advisin (3) - 3 freq addin (3) - 39 freq adamson (3) - 1 freq add-on (3) - 1 freq addition (3) - 17 freq additioun (4) - 1 freq adden (4) - 1 freq davison (4) - 1 freq dodgson (4) - 9 freq dobson (4) - 4 freq adds (4) - 23 freq hudson (4) - 9 freq addisence (4) - 1 freq danson (4) - 1 freq daddin (4) - 1 freq ddin (4) - 5 freq dyson (4) - 1 freq advisor (4) - 10 freq alison (4) - 410 freq addeition (4) - 3 freq ailison (4) - 1 freq damson (4) - 1 freq addison's (4) - 12 freq addan (4) - 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 - ATSN addison - 31 freq |
ADDISON |
| Time to execute Levenshtein function - 0.198769 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.320574 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.027424 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.037130 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.000902 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. |