| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vibes (0) - 6 freq jibes (1) - 2 freq vices (1) - 12 freq vines (1) - 6 freq vibe (1) - 9 freq sixes (2) - 2 freq babes (2) - 6 freq views (2) - 60 freq files (2) - 111 freq mixes (2) - 4 freq vimeo (2) - 2 freq bides (2) - 230 freq yies (2) - 21 freq ciaes (2) - 1 freq uizes (2) - 7 freq videos (2) - 19 freq hives (2) - 2 freq limes (2) - 1 freq hibees (2) - 11 freq aiges (2) - 3 freq mimes (2) - 3 freq sites (2) - 22 freq vivas (2) - 1 freq tiles (2) - 16 freq aines (2) - 2 freq |
vibes (0) - 6 freq vbs (2) - 1 freq vines (2) - 6 freq vibe (2) - 9 freq jibes (2) - 2 freq vices (2) - 12 freq cubes (3) - 12 freq bes (3) - 315 freq voes (3) - 1 freq mibees (3) - 3 freq ribs (3) - 33 freq vales (3) - 4 freq voles (3) - 2 freq libs (3) - 1 freq vaines (3) - 1 freq ves (3) - 2 freq vyces (3) - 65 freq vexes (3) - 3 freq ibs (3) - 3 freq bies (3) - 2 freq vis (3) - 1 freq tubes (3) - 20 freq voices (3) - 113 freq vries (3) - 1 freq robes (3) - 7 freq |
SoundEx code - V120 veyb's - 1 freq vibes - 6 freq vivas - 1 freq vwvg - 1 freq vefz - 1 freq vuvkwi - 1 freq vi-pees - 1 freq |
MetaPhone code - FBS veyb's - 1 freq fobie's - 1 freq vibes - 6 freq fabius - 2 freq phobos - 3 freq fobs - 1 freq phoebus - 3 freq vbs - 1 freq fbsi - 1 freq |
VIBES |
| Time to execute Levenshtein function - 0.191737 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.339118 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.035217 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.037091 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.000939 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. |