| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vibrant (0) - 16 freq libran (2) - 1 freq migrant (2) - 6 freq vibrate (2) - 3 freq vibrato (2) - 1 freq vagrant (2) - 1 freq gibran (2) - 1 freq vibrantly (2) - 1 freq brast (3) - 1 freq 'brunt (3) - 1 freq vaagrant (3) - 1 freq vacant (3) - 8 freq kieran (3) - 26 freq vibrated (3) - 1 freq vrans (3) - 1 freq riband (3) - 1 freq durrant (3) - 2 freq library (3) - 167 freq variant (3) - 16 freq vhbnt (3) - 1 freq birnt (3) - 1 freq rant (3) - 22 freq brent (3) - 17 freq brang (3) - 2 freq iran (3) - 2 freq |
vibrant (0) - 16 freq vibrantly (3) - 1 freq vibrato (3) - 1 freq vagrant (3) - 1 freq vibrate (3) - 3 freq briant (4) - 1 freq byrant (4) - 1 freq variant (4) - 16 freq brent (4) - 17 freq birnt (4) - 1 freq branta (4) - 1 freq brunt (4) - 73 freq migrant (4) - 6 freq 'brunt (4) - 1 freq libran (4) - 1 freq vaagrant (4) - 1 freq gibran (4) - 1 freq vincent (5) - 4 freq airnt (5) - 1 freq violent (5) - 18 freq vrang (5) - 8 freq grant (5) - 101 freq valiant (5) - 5 freq eerant (5) - 2 freq farrant (5) - 21 freq |
SoundEx code - V165 vibrant - 16 freq vibrantly - 1 freq |
MetaPhone code - FBRNT vibrant - 16 freq |
VIBRANT |
| Time to execute Levenshtein function - 0.183041 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.365859 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.029133 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.039359 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.000887 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. |