Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
neidit (1) - 1 freq heidit (1) - 60 freq laidit (1) - 9 freq leimit (1) - 1 freq leivit (1) - 3 freq pleidit (1) - 3 freq cleidit (1) - 2 freq leipit (1) - 1 freq leirit (1) - 24 freq ledit (1) - 1 freq leitit (1) - 3 freq lesmit (2) - 1 freq levit (2) - 2 freq reddit (2) - 13 freq leicht (2) - 2 freq beildit (2) - 4 freq fluidit (2) - 3 freq bleirit (2) - 2 freq lardit (2) - 1 freq needit (2) - 167 freq leid' (2) - 5 freq heidet (2) - 1 freq widit (2) - 1 freq cleikit (2) - 12 freq sendit (2) - 1 freq |
ledit (1) - 1 freq laidit (1) - 9 freq loadit (2) - 19 freq leitit (2) - 3 freq laedit (2) - 1 freq eildit (2) - 12 freq ledeit (2) - 2 freq ladit (2) - 2 freq neidit (2) - 1 freq leirit (2) - 24 freq leimit (2) - 1 freq leivit (2) - 3 freq pleidit (2) - 3 freq leipit (2) - 1 freq heidit (2) - 60 freq cleidit (2) - 2 freq readit (3) - 3 freq feedit (3) - 1 freq hoidit (3) - 3 freq loddit (3) - 2 freq leetit (3) - 6 freq laidin (3) - 2 freq edit (3) - 17 freq bidit (3) - 30 freq leiquit (3) - 1 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 |
LEIDIT |
Time to execute Levenshtein function - 0.393480 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.794455 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.080985 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.037207 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. |