| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laidit (0) - 9 freq laidin (1) - 2 freq raidit (1) - 2 freq lairit (1) - 2 freq laedit (1) - 1 freq lardit (1) - 1 freq aidit (1) - 1 freq landit (1) - 52 freq plaidit (1) - 5 freq ladit (1) - 2 freq raidio (2) - 1 freq raikit (2) - 12 freq maidie (2) - 2 freq daddit (2) - 5 freq hidit (2) - 1 freq leitit (2) - 3 freq laidlin (2) - 1 freq haddit (2) - 1 freq laift (2) - 1 freq 'audit (2) - 1 freq bandit (2) - 7 freq laiden (2) - 2 freq maikit (2) - 1 freq laivin (2) - 2 freq slairit (2) - 2 freq |
laidit (0) - 9 freq laedit (1) - 1 freq ladit (1) - 2 freq ledit (2) - 1 freq lairit (2) - 2 freq loadit (2) - 19 freq plaidit (2) - 5 freq laidin (2) - 2 freq landit (2) - 52 freq raidit (2) - 2 freq lardit (2) - 1 freq aidit (2) - 1 freq blaudit (3) - 2 freq limit (3) - 27 freq neidit (3) - 1 freq laidy (3) - 1 freq heidit (3) - 60 freq leipit (3) - 1 freq fadit (3) - 10 freq livit (3) - 2 freq bidit (3) - 30 freq lifit (3) - 2 freq pleidit (3) - 3 freq luikit (3) - 133 freq laddie (3) - 577 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 |
LAIDIT |
| Time to execute Levenshtein function - 0.308136 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.520687 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.058581 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.037098 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.000906 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. |