| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ledit (0) - 1 freq ladit (1) - 2 freq laedit (1) - 1 freq legit (1) - 4 freq fedit (1) - 1 freq leit (1) - 15 freq levit (1) - 2 freq edit (1) - 17 freq redit (1) - 2 freq ledeit (1) - 2 freq leemit (2) - 14 freq leapit (2) - 2 freq leda (2) - 2 freq lifit (2) - 2 freq weedit (2) - 1 freq laedin (2) - 1 freq ekit (2) - 1 freq eejit (2) - 71 freq levi (2) - 12 freq media (2) - 268 freq fendit (2) - 11 freq heddit (2) - 1 freq bodit (2) - 2 freq leukit (2) - 305 freq fludit (2) - 1 freq |
ledit (0) - 1 freq laedit (1) - 1 freq ledeit (1) - 2 freq ladit (1) - 2 freq legit (2) - 4 freq fedit (2) - 1 freq laidit (2) - 9 freq loadit (2) - 19 freq redit (2) - 2 freq leit (2) - 15 freq levit (2) - 2 freq edit (2) - 17 freq pleadit (3) - 7 freq leukt (3) - 52 freq ledd (3) - 7 freq lardit (3) - 1 freq leest (3) - 12 freq leds (3) - 1 freq limit (3) - 27 freq bydit (3) - 8 freq lykit (3) - 5 freq leirit (3) - 24 freq leetit (3) - 6 freq addit (3) - 97 freq livit (3) - 2 freq |
SoundEx code - L330 latehd - 1 freq loaded - 22 freq loadit - 19 freq loathit - 2 freq laidit - 9 freq laithed - 2 freq lootit - 1 freq leetit - 6 freq luddite - 1 freq loathed - 2 freq la-di-da - 1 freq leided - 1 freq leeted - 1 freq laded - 1 freq ledit - 1 freq ladit - 2 freq loddit - 2 freq loa-tyd - 1 freq laedit - 1 freq lowtit - 2 freq loutit - 3 freq leitit - 3 freq leeded - 1 freq ledeit - 2 freq laid-oot - 1 freq laid-out - 1 freq lauded - 1 freq |
MetaPhone code - LTT latehd - 1 freq loaded - 22 freq loadit - 19 freq laidit - 9 freq lootit - 1 freq leetit - 6 freq luddite - 1 freq la-di-da - 1 freq leided - 1 freq leeted - 1 freq laded - 1 freq ledit - 1 freq ladit - 2 freq loddit - 2 freq loa-tyd - 1 freq laedit - 1 freq lowtit - 2 freq loutit - 3 freq leitit - 3 freq ltd - 8 freq leeded - 1 freq ledeit - 2 freq laid-oot - 1 freq laid-out - 1 freq lauded - 1 freq |
LEDIT |
| Time to execute Levenshtein function - 0.205644 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.475246 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.061766 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.043625 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.001259 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. |