Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
vexes (0) - 3 freq sexes (1) - 5 freq vexed (1) - 47 freq texes (1) - 3 freq exes (1) - 3 freq nedes (2) - 2 freq pees (2) - 2 freq veej (2) - 1 freq menes (2) - 6 freq venus (2) - 32 freq vanes (2) - 2 freq semes (2) - 2 freq voles (2) - 2 freq faxes (2) - 1 freq kemes (2) - 1 freq jees (2) - 3 freq dedes (2) - 1 freq 'eres (2) - 1 freq vext (2) - 14 freq fetes (2) - 1 freq vixen (2) - 1 freq heles (2) - 1 freq dees (2) - 41 freq verus (2) - 1 freq peces (2) - 3 freq |
vexes (0) - 3 freq exes (2) - 3 freq texes (2) - 3 freq sexes (2) - 5 freq vexed (2) - 47 freq axes (3) - 23 freq veins (3) - 44 freq voes (3) - 1 freq vexh (3) - 1 freq vices (3) - 12 freq veils (3) - 3 freq boxes (3) - 64 freq aixes (3) - 4 freq vines (3) - 6 freq vries (3) - 1 freq vexin (3) - 5 freq vexit (3) - 2 freq waxes (3) - 1 freq vxzs (3) - 1 freq venues (3) - 19 freq vegas (3) - 1 freq vets (3) - 9 freq ves (3) - 2 freq exis (3) - 1 freq fixes (3) - 3 freq |
SoundEx code - V220 voices - 113 freq voices- - 3 freq vyces - 65 freq veicious - 6 freq vices - 12 freq vicious - 17 freq visage - 3 freq vicous - 1 freq viscous - 1 freq voicees - 1 freq viccy's - 1 freq vacuous - 2 freq vegas - 1 freq veggies - 9 freq viscus - 1 freq veesiks - 2 freq vawses - 1 freq vossis - 2 freq voyces - 1 freq veecious - 2 freq vexes - 3 freq vycikie - 6 freq vaiges - 1 freq vizzies - 3 freq vases - 3 freq vaxx-jegs - 1 freq vcwycg - 1 freq vpszuk - 1 freq vsxkquyzk - 1 freq vgos - 1 freq vkjeoxha - 1 freq 'voices - 1 freq vczjjiacw - 1 freq |
MetaPhone code - FKSS fixes - 3 freq foxes - 9 freq viccy's - 1 freq faxes - 1 freq vexes - 3 freq foxes' - 1 freq focuses - 2 freq fqusuz - 1 freq |
VEXES |
Time to execute Levenshtein function - 0.217920 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.372267 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.027881 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.042813 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.000874 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. |