| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leimitit (0) - 6 freq leemitit (1) - 7 freq leimitin (1) - 1 freq limitit (1) - 9 freq leemitin (2) - 1 freq leitit (2) - 3 freq veisitit (2) - 7 freq lifitit (2) - 2 freq leimit (2) - 1 freq permitirt (3) - 1 freq fleimit (3) - 3 freq limpit (3) - 1 freq commitit (3) - 5 freq liltit (3) - 2 freq leitmotif (3) - 1 freq leivit (3) - 3 freq veesitit (3) - 8 freq lestit (3) - 11 freq excitit (3) - 31 freq beaminit (3) - 1 freq leirit (3) - 24 freq termintit (3) - 2 freq semitic (3) - 1 freq veisitin (3) - 4 freq eimitate (3) - 1 freq |
leimitit (0) - 6 freq leemitit (1) - 7 freq limitit (1) - 9 freq leimitin (2) - 1 freq leimit (3) - 1 freq lifitit (3) - 2 freq leemitin (3) - 1 freq leitit (3) - 3 freq leemit (4) - 14 freq leemited (4) - 1 freq limit (4) - 27 freq demotit (4) - 1 freq limited (4) - 20 freq lempit (4) - 2 freq limits (4) - 15 freq laminit (4) - 1 freq listit (4) - 7 freq leemits (4) - 19 freq smitit (4) - 1 freq luistit (4) - 1 freq eimitate (4) - 1 freq liftit (4) - 135 freq animatit (4) - 3 freq laistit (4) - 2 freq leetit (4) - 6 freq |
SoundEx code - L533 landit - 52 freq lunt-widd - 1 freq limited - 20 freq landed - 70 freq leimitations - 2 freq laundit - 11 freq leemitations - 2 freq limitit - 9 freq landet - 5 freq limitation - 1 freq laandit - 4 freq laanded - 5 freq luntit - 3 freq leemeted - 15 freq leemetitions - 1 freq leemetation - 1 freq lint-white - 1 freq limitations - 2 freq leemited - 1 freq lantit - 1 freq leimitit - 6 freq leemitit - 7 freq lint-watter - 1 freq lenethedane - 4 freq |
MetaPhone code - LMTT limited - 20 freq limitit - 9 freq leemeted - 15 freq leemited - 1 freq leimitit - 6 freq leemitit - 7 freq |
LEIMITIT |
| Time to execute Levenshtein function - 0.242191 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.448374 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.027735 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.040865 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.000904 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. |