| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vext (0) - 14 freq veet (1) - 6 freq vex't (1) - 2 freq vet (1) - 37 freq vert (1) - 1 freq vent (1) - 6 freq next (1) - 955 freq vex (1) - 6 freq text (1) - 170 freq vexh (1) - 1 freq vexit (1) - 2 freq sext (1) - 1 freq vest (1) - 14 freq met (2) - 413 freq mert (2) - 1 freq vqx (2) - 1 freq eit (2) - 644 freq virt (2) - 1 freq debt (2) - 45 freq mect (2) - 1 freq raxt (2) - 12 freq vents (2) - 1 freq fect (2) - 12 freq boxt (2) - 1 freq heft (2) - 111 freq |
vext (0) - 14 freq vexit (1) - 2 freq vexh (2) - 1 freq vex't (2) - 2 freq vest (2) - 14 freq veet (2) - 6 freq text (2) - 170 freq sext (2) - 1 freq vet (2) - 37 freq vex (2) - 6 freq vent (2) - 6 freq vert (2) - 1 freq next (2) - 955 freq vx (3) - 5 freq vat (3) - 12 freq bexit (3) - 1 freq nxt (3) - 38 freq eveit (3) - 3 freq event (3) - 103 freq avert (3) - 1 freq vexed (3) - 47 freq taxt (3) - 3 freq nixt (3) - 473 freq vott (3) - 2 freq vpt (3) - 1 freq |
SoundEx code - V230 veisit - 25 freq vizzied - 26 freq veesit - 93 freq visit - 147 freq vext - 14 freq vyce-the - 1 freq vexed - 47 freq vast - 36 freq 'visit - 1 freq vest - 14 freq voyagit - 8 freq vexit - 2 freq voiced - 16 freq voice-the - 1 freq vouchit - 1 freq vïsit - 4 freq vaeged - 2 freq vista - 3 freq vyced - 3 freq voustie - 1 freq vex't - 2 freq vaikit - 1 freq vesta - 2 freq vissied - 2 freq vexxed - 1 freq vaiged - 1 freq vaigit - 1 freq vacate - 1 freq vjday - 2 freq vjctd - 1 freq vsd - 1 freq vashti - 2 freq vst - 1 freq |
MetaPhone code - FKST fixed - 73 freq foggiest - 8 freq fykiest - 2 freq vext - 14 freq vexed - 47 freq focused - 27 freq fixit - 7 freq vexit - 2 freq fokest - 1 freq focussit - 1 freq vex't - 2 freq foxed - 2 freq vexxed - 1 freq focusit - 1 freq focussed - 8 freq figst - 1 freq |
VEXT |
| Time to execute Levenshtein function - 0.258552 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.509128 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.029501 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.073658 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.000938 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. |