| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laedit (0) - 1 freq landit (1) - 52 freq ladit (1) - 2 freq laidit (1) - 9 freq laekit (1) - 18 freq ledit (1) - 1 freq lardit (1) - 1 freq laedin (1) - 1 freq daddit (2) - 5 freq daetit (2) - 1 freq luekit (2) - 2 freq haddit (2) - 1 freq wadit (2) - 1 freq needit (2) - 167 freq aidit (2) - 1 freq loddit (2) - 2 freq haedin (2) - 1 freq glaepit (2) - 4 freq fedit (2) - 1 freq lait (2) - 4 freq laldi (2) - 1 freq laddie (2) - 577 freq laepin (2) - 1 freq lappit (2) - 7 freq laet (2) - 9 freq |
laedit (0) - 1 freq ledit (1) - 1 freq laidit (1) - 9 freq ladit (1) - 2 freq ledeit (2) - 2 freq loadit (2) - 19 freq laedin (2) - 1 freq landit (2) - 52 freq laekit (2) - 18 freq lardit (2) - 1 freq edit (3) - 17 freq audit (3) - 12 freq laupit (3) - 1 freq redit (3) - 2 freq leemit (3) - 14 freq blaudit (3) - 2 freq leevit (3) - 4 freq waldit (3) - 1 freq 'audit (3) - 1 freq fadit (3) - 10 freq leit (3) - 15 freq laundit (3) - 11 freq leekit (3) - 1 freq levit (3) - 2 freq lairit (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 |
LAEDIT |
| Time to execute Levenshtein function - 0.207426 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.341337 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.028646 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.037834 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.000900 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. |