| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vibrant (0) - 16 freq gibran (2) - 1 freq vibrato (2) - 1 freq libran (2) - 1 freq vibrantly (2) - 1 freq vagrant (2) - 1 freq migrant (2) - 6 freq vibrate (2) - 5 freq tirnt (3) - 21 freq libra (3) - 2 freq migrants (3) - 6 freq violent (3) - 18 freq brand (3) - 51 freq libyan (3) - 1 freq ribbans (3) - 1 freq rant (3) - 26 freq branta (3) - 1 freq carrant (3) - 2 freq versant (3) - 2 freq valiant (3) - 5 freq brent (3) - 17 freq variant (3) - 16 freq pissant (3) - 1 freq vibrator (3) - 1 freq vibrated (3) - 1 freq |
vibrant (0) - 16 freq vibrate (3) - 5 freq vagrant (3) - 1 freq vibrantly (3) - 1 freq vibrato (3) - 1 freq brunt (4) - 73 freq variant (4) - 16 freq brent (4) - 17 freq byrant (4) - 1 freq briant (4) - 1 freq vaagrant (4) - 1 freq branta (4) - 1 freq birnt (4) - 1 freq 'brunt (4) - 1 freq migrant (4) - 6 freq gibran (4) - 1 freq libran (4) - 1 freq iront (5) - 1 freq grant (5) - 101 freq brang (5) - 2 freq airnt (5) - 1 freq kirnt (5) - 2 freq vrang (5) - 8 freq emigrant (5) - 2 freq eerrant (5) - 1 freq |
SoundEx code - V165 vibrant - 16 freq vibrantly - 1 freq |
MetaPhone code - FBRNT vibrant - 16 freq |
VIBRANT |
| Time to execute Levenshtein function - 0.199493 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.359640 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.031227 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.037565 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.000884 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. |