| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vaccination (0) - 1 freq vaccinations (1) - 2 freq fascination (2) - 7 freq validation (3) - 2 freq inclination (3) - 6 freq machinations (3) - 1 freq accusation (3) - 8 freq fascinatin (3) - 16 freq variation (3) - 18 freq vacation (3) - 2 freq lamination (3) - 1 freq fescination (3) - 1 freq validatin (4) - 1 freq accusations (4) - 7 freq fabrication (4) - 1 freq abdication (4) - 1 freq attintion (4) - 3 freq examination (4) - 8 freq destination (4) - 19 freq imaagination (4) - 1 freq crocanation (4) - 1 freq variations (4) - 16 freq exemination (4) - 1 freq damnation (4) - 3 freq combination (4) - 23 freq |
vaccination (0) - 1 freq vaccinations (2) - 2 freq fascination (4) - 7 freq accusation (5) - 8 freq fascinatin (5) - 16 freq fescination (5) - 1 freq vacation (5) - 2 freq inclination (5) - 6 freq occupation (6) - 14 freq deracination (6) - 1 freq incarnation (6) - 3 freq fascinatan (6) - 1 freq accountin (6) - 2 freq evacuation (6) - 1 freq vocation (6) - 2 freq crocanation (6) - 1 freq carnation (6) - 3 freq accoontin (6) - 5 freq fescinatin (6) - 1 freq micronation (6) - 1 freq validation (6) - 2 freq variation (6) - 18 freq lamination (6) - 1 freq machinations (6) - 1 freq fascinatit (7) - 4 freq |
SoundEx code - V253 vacant - 8 freq vicinity - 8 freq viszontlatdsra - 1 freq vacantly - 3 freq viscount - 2 freq visand - 1 freq voice-haunted - 1 freq vegemite's - 1 freq vacand - 1 freq vignettes - 1 freq vaccinations - 2 freq vaccination - 1 freq vicssundays - 1 freq |
MetaPhone code - FKSNXN vaccination - 1 freq |
VACCINATION |
| Time to execute Levenshtein function - 0.285295 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.394270 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.027305 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.037410 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.000925 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. |