| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| addition (0) - 17 freq additioun (1) - 1 freq addiction (1) - 9 freq audition (1) - 8 freq addeition (1) - 3 freq auditions (2) - 1 freq additive (2) - 3 freq addictions (2) - 4 freq addison (2) - 31 freq addeetion (2) - 3 freq edition (2) - 27 freq adaption (2) - 1 freq ambition (2) - 16 freq additional (2) - 14 freq edeition (2) - 13 freq addition's (2) - 1 freq sedition (2) - 7 freq adoption (2) - 16 freq aitin (3) - 21 freq admission (3) - 4 freq apinion (3) - 1 freq tradition (3) - 55 freq partition (3) - 4 freq action (3) - 138 freq eddication (3) - 51 freq |
addition (0) - 17 freq additioun (1) - 1 freq addeition (1) - 3 freq addeetion (2) - 3 freq audition (2) - 8 freq addiction (2) - 9 freq edeition (3) - 13 freq additional (3) - 14 freq adaption (3) - 1 freq adoption (3) - 16 freq sedition (3) - 7 freq addeetioun (3) - 2 freq addison (3) - 31 freq additive (3) - 3 freq edition (3) - 27 freq aduration (4) - 1 freq adulation (4) - 1 freq editioun (4) - 2 freq apdatin (4) - 2 freq adoptin (4) - 5 freq addit (4) - 97 freq adoration (4) - 6 freq diction (4) - 9 freq adaptin (4) - 1 freq edeetion (4) - 12 freq |
SoundEx code - A335 addition's - 1 freq audition - 8 freq addition - 17 freq auditionin - 4 freq additional - 14 freq addeetioun - 2 freq auditions - 1 freq additioinal - 1 freq auditin' - 1 freq additioun - 1 freq addeition - 3 freq addeetional - 3 freq athooten - 1 freq addeitionally - 1 freq addeetion - 3 freq athouten - 2 freq |
MetaPhone code - ATXN audition - 8 freq addition - 17 freq addeetioun - 2 freq additioun - 1 freq addeition - 3 freq addeetion - 3 freq |
ADDITION |
| Time to execute Levenshtein function - 0.181576 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.340267 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.027632 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.036909 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.005002 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. |