| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| limitit (0) - 9 freq leimitit (1) - 6 freq lifitit (1) - 2 freq liltit (2) - 2 freq visitit (2) - 2 freq leimitin (2) - 1 freq leemitit (2) - 7 freq limpit (2) - 1 freq leitit (2) - 3 freq lightit (2) - 1 freq listit (2) - 7 freq lichtit (2) - 64 freq limit (2) - 27 freq limits (2) - 15 freq limiting (2) - 1 freq smitit (2) - 1 freq liftit (2) - 134 freq laminit (2) - 1 freq limited (2) - 19 freq lirkit (3) - 7 freq laidit (3) - 9 freq awaitit (3) - 3 freq mistit (3) - 1 freq iftit (3) - 1 freq demotit (3) - 1 freq |
limitit (0) - 9 freq leimitit (1) - 6 freq lifitit (2) - 2 freq leemitit (2) - 7 freq smitit (3) - 1 freq limits (3) - 15 freq laminit (3) - 1 freq limited (3) - 19 freq limit (3) - 27 freq liftit (3) - 134 freq listit (3) - 7 freq liltit (3) - 2 freq limpit (3) - 1 freq leimitin (3) - 1 freq leitit (3) - 3 freq lantit (4) - 1 freq limpet (4) - 5 freq lumpit (4) - 1 freq lestit (4) - 11 freq liftet (4) - 17 freq lootit (4) - 1 freq smitt (4) - 1 freq luistit (4) - 1 freq mitt (4) - 6 freq luntit (4) - 3 freq |
SoundEx code - L533 landit - 52 freq lunt-widd - 1 freq limited - 19 freq landed - 67 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 - 19 freq limitit - 9 freq leemeted - 15 freq leemited - 1 freq leimitit - 6 freq leemitit - 7 freq |
LIMITIT |
| Time to execute Levenshtein function - 0.194435 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.354285 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.027692 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.036904 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.000828 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. |