| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| visionary (0) - 4 freq midsionary (2) - 1 freq missionary (2) - 6 freq victoary (3) - 1 freq visions (3) - 7 freq dictionary (3) - 124 freq vision (3) - 61 freq illusionary (4) - 1 freq discovry (4) - 1 freq coronary (4) - 1 freq vistors (4) - 1 freq visitn (4) - 1 freq customary (4) - 7 freq stoary (4) - 1 freq visitor (4) - 23 freq 'vision' (4) - 1 freq sindry (4) - 131 freq stationary (4) - 1 freq millionare (4) - 1 freq visibly (4) - 9 freq timporary (4) - 1 freq sinnart (4) - 1 freq visor (4) - 2 freq wisnay (4) - 2 freq veesonar (4) - 1 freq |
visionary (0) - 4 freq vision (4) - 61 freq visions (4) - 7 freq veesonar (4) - 1 freq missionary (4) - 6 freq midsionary (4) - 1 freq visietor (5) - 5 freq visitor (5) - 23 freq visitir (5) - 1 freq vistor (5) - 1 freq veision (5) - 2 freq vestiary (5) - 1 freq victoary (5) - 1 freq visor (5) - 2 freq veisitar (5) - 2 freq sonar (5) - 1 freq diversionary (6) - 2 freq history (6) - 481 freq soary (6) - 3 freq cautionary (6) - 2 freq victory (6) - 44 freq siner (6) - 1 freq veesions (6) - 4 freq visnomie (6) - 1 freq veesion (6) - 25 freq |
SoundEx code - V256 visionary - 4 freq veesonar - 1 freq €˜veisionaries - 1 freq vigginer - 1 freq |
MetaPhone code - FXNR visionary - 4 freq |
VISIONARY |
| Time to execute Levenshtein function - 0.492605 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.717386 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.080465 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.096133 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.001298 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. |