| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vegemite's (2) - 1 freq yosemite (3) - 2 freq leemit (3) - 14 freq veesiter (3) - 1 freq veesits (3) - 15 freq veggie (3) - 15 freq seemit (3) - 20 freq enemie (3) - 7 freq jeemie (3) - 61 freq egejit (3) - 1 freq leemited (3) - 1 freq veesited (3) - 7 freq eyesite (3) - 1 freq deemit (3) - 2 freq leemits (3) - 19 freq feemit (3) - 1 freq meenite (3) - 1 freq deemie (3) - 3 freq veesit (3) - 93 freq jugemint (4) - 1 freq delegate (4) - 3 freq voamit (4) - 2 freq bekalite (4) - 1 freq peesie (4) - 1 freq meteorite (4) - 2 freq |
vegemite's (4) - 1 freq feemit (5) - 1 freq vomit (5) - 9 freq voamit (5) - 2 freq egejit (5) - 1 freq veesit (5) - 93 freq deemit (5) - 2 freq leemit (5) - 14 freq veggie (5) - 15 freq yosemite (5) - 2 freq seemit (5) - 20 freq versity (6) - 11 freq permit (6) - 7 freq emit (6) - 4 freq seemt (6) - 109 freq peggit (6) - 2 freq semmit (6) - 23 freq semit (6) - 1 freq smite (6) - 4 freq vreit (6) - 1 freq legality (6) - 2 freq remit (6) - 11 freq overbite (6) - 1 freq vogie (6) - 3 freq veige (6) - 2 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 - FJMT |
VEGEMITE |
| Time to execute Levenshtein function - 0.203000 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.383119 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.027772 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.038267 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.000915 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. |