| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vowed (0) - 5 freq voted (1) - 39 freq lowed (1) - 3 freq vow'd (1) - 1 freq dowed (1) - 1 freq cowed (1) - 7 freq howed (1) - 2 freq wowed (1) - 1 freq rowed (1) - 73 freq avowed (1) - 1 freq mowed (1) - 1 freq vowel (1) - 87 freq owed (1) - 13 freq bowed (1) - 37 freq sowed (1) - 11 freq towed (1) - 6 freq jowed (1) - 2 freq vaned (2) - 1 freq gowped (2) - 5 freq unwed (2) - 1 freq powes (2) - 3 freq howe (2) - 77 freq bowld (2) - 3 freq sewed (2) - 1 freq flowed (2) - 9 freq |
vowed (0) - 5 freq avowed (1) - 1 freq vowel (2) - 87 freq owed (2) - 13 freq mowed (2) - 1 freq towed (2) - 6 freq viewed (2) - 9 freq jowed (2) - 2 freq bowed (2) - 37 freq sowed (2) - 11 freq rowed (2) - 73 freq lowed (2) - 3 freq voted (2) - 39 freq dowed (2) - 1 freq vow'd (2) - 1 freq howed (2) - 2 freq wowed (2) - 1 freq cowed (2) - 7 freq cowid (3) - 3 freq voyd (3) - 2 freq meowed (3) - 1 freq vod (3) - 1 freq wawed (3) - 1 freq swed (3) - 1 freq wed (3) - 22 freq |
SoundEx code - V300 vote - 253 freq void - 15 freq vat - 12 freq vood - 2 freq vet - 33 freq voot - 1 freq vidi - 1 freq vitae - 3 freq vow'd - 1 freq vot - 1 freq voodoo - 2 freq video - 105 freq voddie - 8 freq viewed - 9 freq veet - 6 freq voddy - 2 freq vid - 4 freq vit - 3 freq vott - 2 freq vowed - 5 freq vodd - 2 freq voyd - 2 freq voyied - 1 freq vod - 1 freq voo'd - 1 freq ve'd - 1 freq vaudie - 1 freq vita - 1 freq voat - 1 freq vóat - 1 freq €œvote - 1 freq vuty - 1 freq vwdh - 1 freq vada - 1 freq vidyo - 1 freq vbt - 1 freq voodo - 1 freq vath - 1 freq vwdy - 1 freq vethe - 1 freq vpt - 1 freq vido - 1 freq vd - 2 freq vbwtwe - 1 freq |
MetaPhone code - FWT fawed - 6 freq viewed - 9 freq vowed - 5 freq fawit - 2 freq hfwaet - 1 freq |
VOWED |
| Time to execute Levenshtein function - 0.196632 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.334998 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.027554 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.036910 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.000807 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. |