| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laundit (0) - 11 freq laandit (1) - 4 freq haundit (1) - 63 freq laundin (1) - 14 freq landit (1) - 52 freq blaudit (2) - 2 freq haunit (2) - 2 freq haundie (2) - 1 freq luntit (2) - 3 freq ladit (2) - 2 freq landis (2) - 6 freq lauchit (2) - 3 freq laundry (2) - 10 freq hauddit (2) - 18 freq landin (2) - 45 freq flauntit (2) - 1 freq haunnit (2) - 2 freq haunlit (2) - 1 freq launchit (2) - 8 freq soundit (2) - 29 freq launin (2) - 1 freq laandin (2) - 1 freq saundie (2) - 1 freq pandit (2) - 57 freq foundit (2) - 6 freq |
laundit (0) - 11 freq landit (1) - 52 freq laandit (1) - 4 freq laundin (2) - 14 freq haundit (2) - 63 freq landet (2) - 5 freq fundit (3) - 19 freq laidit (3) - 9 freq launds (3) - 19 freq pundit (3) - 3 freq randit (3) - 1 freq lannit (3) - 3 freq woundit (3) - 17 freq wundit (3) - 3 freq handit (3) - 27 freq lantit (3) - 1 freq roundit (3) - 3 freq boundit (3) - 1 freq lindt (3) - 1 freq haundet (3) - 4 freq lundin (3) - 1 freq haandit (3) - 8 freq bandit (3) - 7 freq laedit (3) - 1 freq lardit (3) - 1 freq |
SoundEx code - L533 landit - 52 freq lunt-widd - 1 freq limited - 20 freq landed - 70 freq leimitations - 2 freq laundit - 11 freq leemitations - 2 freq limitit - 9 freq landet - 5 freq limitation - 1 freq laandit - 4 freq laanded - 5 freq luntit - 3 freq leemeted - 15 freq leemetitions - 1 freq leemetation - 1 freq lint-white - 1 freq limitations - 2 freq leemited - 1 freq lantit - 1 freq leimitit - 6 freq leemitit - 7 freq lint-watter - 1 freq lenethedane - 4 freq |
MetaPhone code - LNTT landit - 52 freq landed - 70 freq laundit - 11 freq landet - 5 freq laandit - 4 freq laanded - 5 freq lindt - 1 freq luntit - 3 freq lantit - 1 freq |
LAUNDIT |
| Time to execute Levenshtein function - 0.339636 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.594946 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.060478 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.039419 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.000911 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. |