| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vomited (0) - 4 freq vomit (2) - 9 freq commited (2) - 2 freq mited (2) - 1 freq vomitin (2) - 1 freq voiced (2) - 16 freq limited (2) - 20 freq voted (2) - 41 freq voyied (2) - 1 freq visited (2) - 23 freq doited (2) - 2 freq prompted (3) - 1 freq ruited (3) - 4 freq hominid (3) - 1 freq comete (3) - 1 freq toted (3) - 1 freq doatted (3) - 1 freq vortex (3) - 2 freq ooted (3) - 1 freq void (3) - 17 freq vomiting (3) - 1 freq stoited (3) - 2 freq mounted (3) - 8 freq compiled (3) - 1 freq doubted (3) - 7 freq |
vomited (0) - 4 freq limited (3) - 20 freq visited (3) - 23 freq vomitin (3) - 1 freq voted (3) - 41 freq mited (3) - 1 freq vomit (3) - 9 freq voamit (4) - 2 freq muted (4) - 8 freq violated (4) - 2 freq leemited (4) - 1 freq veisited (4) - 3 freq veesited (4) - 7 freq meted (4) - 2 freq vaulted (4) - 1 freq vaunted (4) - 2 freq voiced (4) - 16 freq voyied (4) - 1 freq doited (4) - 2 freq commited (4) - 2 freq vested (4) - 2 freq rousted (5) - 2 freq votit (5) - 42 freq remixed (5) - 1 freq coonted (5) - 16 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.200570 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.391007 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.028086 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.037629 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. |