| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vomited (0) - 4 freq vomit (2) - 9 freq voted (2) - 39 freq voyied (2) - 1 freq visited (2) - 23 freq vomitin (2) - 1 freq doited (2) - 2 freq limited (2) - 19 freq commited (2) - 2 freq voiced (2) - 16 freq mited (2) - 1 freq shuited (3) - 6 freq doated (3) - 1 freq voicer (3) - 1 freq mixed (3) - 48 freq olite (3) - 3 freq whited (3) - 2 freq rowsted (3) - 6 freq votes (3) - 69 freq soiled (3) - 2 freq gomed (3) - 18 freq waited (3) - 107 freq boiled (3) - 6 freq muted (3) - 8 freq voytek (3) - 1 freq |
vomited (0) - 4 freq vomitin (3) - 1 freq limited (3) - 19 freq mited (3) - 1 freq visited (3) - 23 freq vomit (3) - 9 freq voted (3) - 39 freq vested (4) - 2 freq leemited (4) - 1 freq veisited (4) - 3 freq muted (4) - 8 freq meted (4) - 2 freq vaulted (4) - 1 freq vaunted (4) - 2 freq violated (4) - 2 freq doited (4) - 2 freq voyied (4) - 1 freq commited (4) - 2 freq voiced (4) - 16 freq voamit (4) - 2 freq veesited (4) - 7 freq maitied (5) - 1 freq dominated (5) - 3 freq combed (5) - 3 freq awaited (5) - 4 freq |
SoundEx code - V533 vaunted - 2 freq vanded - 1 freq vomited - 4 freq vendetta - 1 freq |
MetaPhone code - FMTT vomited - 4 freq |
VOMITED |
| Time to execute Levenshtein function - 0.209037 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.373690 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.028769 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.037053 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.000836 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. |