Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
vibe (0) - 9 freq vibes (1) - 6 freq vice (1) - 66 freq vie (1) - 4 freq jibe (1) - 1 freq vile (1) - 14 freq vire (1) - 2 freq vine (1) - 25 freq mibe (1) - 3 freq zine (2) - 2 freq ike (2) - 1 freq vbk (2) - 2 freq pile (2) - 110 freq libr (2) - 1 freq hike (2) - 19 freq vizz (2) - 1 freq mice (2) - 52 freq wiye (2) - 2 freq time (2) - 5878 freq pine (2) - 23 freq vape (2) - 1 freq wive (2) - 1 freq vim (2) - 1 freq 'ice (2) - 1 freq vi's (2) - 4 freq |
vibe (0) - 9 freq vine (2) - 25 freq mibe (2) - 3 freq vire (2) - 2 freq vb (2) - 1 freq vba (2) - 1 freq vile (2) - 14 freq vibes (2) - 6 freq vice (2) - 66 freq vie (2) - 4 freq jibe (2) - 1 freq babe (3) - 11 freq be (3) - 14795 freq robe (3) - 5 freq veice (3) - 2 freq ovine (3) - 1 freq vyee (3) - 8 freq evie (3) - 8 freq view (3) - 238 freq tbe (3) - 1 freq nib (3) - 10 freq vin (3) - 6 freq fib (3) - 3 freq avise (3) - 1 freq visa (3) - 5 freq |
SoundEx code - V100 vieve - 13 freq veive - 5 freq vibe - 9 freq ve've - 1 freq veeve - 5 freq viv - 1 freq veev - 1 freq vievie - 1 freq viva - 6 freq vevf - 1 freq vape - 1 freq vip - 1 freq vivi - 2 freq |
MetaPhone code - FB fib - 3 freq fab - 18 freq phobia - 3 freq vibe - 9 freq fobie - 32 freq fbi - 1 freq fabby - 68 freq fob - 4 freq fabio - 1 freq feb - 7 freq fabbie - 2 freq fb - 27 freq phb - 1 freq wvb - 1 freq fabbh - 1 freq fub - 2 freq vba - 1 freq wfb - 1 freq feba - 1 freq yvb - 1 freq ghb - 1 freq yfb - 1 freq hvb - 2 freq fibo - 1 freq vb - 1 freq |
VIBE |
Time to execute Levenshtein function - 0.197094 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.336594 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.047321 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.039117 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.000760 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. |