| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| limitations (0) - 2 freq leimitations (1) - 2 freq imitations (1) - 3 freq limitation (1) - 1 freq imitation (2) - 4 freq timptations (2) - 1 freq leemitations (2) - 2 freq litigation (3) - 1 freq timptation's (3) - 1 freq imitatin (3) - 3 freq lamination (3) - 1 freq visitation (3) - 1 freq timptation (3) - 1 freq nominations (3) - 5 freq citations (3) - 3 freq lamentations (3) - 1 freq temptations (3) - 2 freq invitations (3) - 4 freq eimitator (4) - 1 freq conotations (4) - 4 freq eddications (4) - 1 freq flirtatious (4) - 1 freq denotations (4) - 2 freq vibrations (4) - 4 freq motivations (4) - 2 freq |
limitations (0) - 2 freq leimitations (1) - 2 freq limitation (2) - 1 freq leemitations (2) - 2 freq imitations (2) - 3 freq imitation (4) - 4 freq leemetitions (4) - 1 freq lamentations (4) - 1 freq timptations (4) - 1 freq invitations (5) - 4 freq lamentatiouns (5) - 2 freq citations (5) - 3 freq leemetation (5) - 1 freq temptations (5) - 2 freq imitatin (5) - 3 freq lamination (5) - 1 freq nominations (5) - 5 freq mutation (6) - 1 freq mittens (6) - 4 freq stations (6) - 10 freq insitutions (6) - 1 freq reputations (6) - 1 freq veesitations (6) - 1 freq rotations (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 |
LIMITATIONS |
| Time to execute Levenshtein function - 0.689303 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 - 1.279887 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.100626 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.118508 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.000974 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. |