| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leemitations (0) - 2 freq leimitations (1) - 2 freq veesitations (2) - 1 freq limitations (2) - 2 freq leemetitions (2) - 1 freq leemetation (2) - 1 freq eemitatin (3) - 1 freq imitations (3) - 3 freq temptations (3) - 2 freq seetiations (3) - 3 freq limitation (3) - 1 freq veesitation (3) - 1 freq palpitations (4) - 1 freq derivations (4) - 2 freq fermentations (4) - 1 freq timptations (4) - 1 freq hesitation (4) - 12 freq examinations (4) - 1 freq defemination (4) - 1 freq legislations (4) - 1 freq seetivation (4) - 1 freq illuminations (4) - 3 freq leemitin (4) - 1 freq seetuations (4) - 1 freq eemitates (4) - 1 freq |
leemitations (0) - 2 freq leimitations (1) - 2 freq limitations (2) - 2 freq leemetitions (2) - 1 freq leemetation (3) - 1 freq limitation (4) - 1 freq imitations (4) - 3 freq veesitations (4) - 1 freq seetiations (5) - 3 freq lamentations (5) - 1 freq eemitatin (5) - 1 freq temptations (5) - 2 freq eetimtation (6) - 2 freq denotations (6) - 2 freq citations (6) - 3 freq eemitates (6) - 1 freq imitation (6) - 4 freq invitations (6) - 4 freq lamentatiouns (6) - 2 freq nominations (6) - 5 freq lamination (6) - 1 freq seetuations (6) - 1 freq reputations (6) - 1 freq timptations (6) - 1 freq palpitations (6) - 1 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 - LMTXNS leimitations - 2 freq leemitations - 2 freq leemetitions - 1 freq limitations - 2 freq |
LEEMITATIONS |
| Time to execute Levenshtein function - 0.222722 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.403669 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.027566 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.037520 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.000860 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. |