| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ledeit (0) - 2 freq ledit (1) - 1 freq nedeit (1) - 1 freq leipit (2) - 1 freq leit (2) - 15 freq weeit (2) - 1 freq leukit (2) - 305 freq lede (2) - 9 freq ledes (2) - 12 freq levelt (2) - 1 freq redein (2) - 1 freq leest (2) - 12 freq eedjit (2) - 7 freq leirit (2) - 24 freq ludgit (2) - 5 freq leivit (2) - 3 freq leevit (2) - 4 freq edgit (2) - 1 freq levit (2) - 2 freq bedein (2) - 2 freq beddit (2) - 16 freq eveit (2) - 3 freq ladit (2) - 2 freq leggit (2) - 1 freq bedsit (2) - 4 freq |
ledeit (0) - 2 freq ledit (1) - 1 freq ladit (2) - 2 freq nedeit (2) - 1 freq laedit (2) - 1 freq leimit (3) - 1 freq edit (3) - 17 freq leeft (3) - 11 freq deeit (3) - 1 freq loddit (3) - 2 freq leemit (3) - 14 freq laidit (3) - 9 freq leapit (3) - 2 freq leddie (3) - 28 freq loadit (3) - 19 freq leekit (3) - 1 freq leent (3) - 26 freq fedit (3) - 1 freq redit (3) - 2 freq learit (3) - 3 freq leetit (3) - 6 freq ladent (3) - 1 freq leitit (3) - 3 freq leet (3) - 81 freq legit (3) - 4 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 |
LEDEIT |
| Time to execute Levenshtein function - 0.249533 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.441714 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.032055 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.038452 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.000998 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. |