| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| audition (0) - 8 freq addition (1) - 17 freq auditions (1) - 1 freq auditionin (2) - 4 freq ambition (2) - 14 freq addeition (2) - 3 freq auction (2) - 3 freq sedition (2) - 7 freq auditin' (2) - 1 freq addiction (2) - 9 freq edition (2) - 27 freq tuition (2) - 7 freq additioun (2) - 1 freq aduration (3) - 1 freq edeition (3) - 13 freq perdition (3) - 1 freq addeetion (3) - 3 freq ruction (3) - 1 freq apinion (3) - 1 freq ambeition (3) - 1 freq austin (3) - 4 freq petition (3) - 11 freq additive (3) - 3 freq nutrition (3) - 4 freq attintion (3) - 3 freq |
audition (0) - 8 freq edition (2) - 27 freq auditions (2) - 1 freq addition (2) - 17 freq additioun (3) - 1 freq editin (3) - 22 freq editioun (3) - 2 freq edeition (3) - 13 freq tuition (3) - 7 freq addeition (3) - 3 freq sedition (3) - 7 freq auction (3) - 3 freq auditionin (3) - 4 freq auditin' (3) - 1 freq caution (4) - 9 freq awaitin (4) - 6 freq audit (4) - 12 freq radiation (4) - 3 freq duration (4) - 5 freq quoitin (4) - 1 freq aitin (4) - 21 freq naition (4) - 1 freq fuitin (4) - 2 freq auditour (4) - 2 freq unitin (4) - 2 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 |
AUDITION |
| Time to execute Levenshtein function - 0.193859 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.410135 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.035543 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.037438 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.000866 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. |