| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ladit (0) - 2 freq lait (1) - 4 freq fadit (1) - 10 freq laidit (1) - 9 freq ledit (1) - 1 freq lardit (1) - 1 freq wadit (1) - 1 freq laedit (1) - 1 freq loadit (1) - 19 freq landit (1) - 52 freq ladin (1) - 1 freq vadim (2) - 1 freq lndia (2) - 1 freq blaudit (2) - 2 freq loadin (2) - 5 freq laein (2) - 9 freq nadir (2) - 1 freq laldi (2) - 1 freq levit (2) - 2 freq laast (2) - 8 freq laift (2) - 1 freq sadie (2) - 25 freq legit (2) - 4 freq lat (2) - 555 freq habit (2) - 50 freq |
ladit (0) - 2 freq loadit (1) - 19 freq ledit (1) - 1 freq laidit (1) - 9 freq laedit (1) - 1 freq ledeit (2) - 2 freq ladin (2) - 1 freq landit (2) - 52 freq wadit (2) - 1 freq lait (2) - 4 freq fadit (2) - 10 freq lardit (2) - 1 freq lufit (3) - 1 freq aidit (3) - 1 freq laidin (3) - 2 freq laant (3) - 1 freq audit (3) - 12 freq laded (3) - 1 freq luvit (3) - 1 freq wydit (3) - 1 freq lady (3) - 163 freq 'audit (3) - 1 freq laft (3) - 27 freq pleadit (3) - 7 freq laundit (3) - 11 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 |
LADIT |
| Time to execute Levenshtein function - 0.339538 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.781210 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.079223 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.037551 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.000931 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. |