| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vibrated (0) - 1 freq vibrate (1) - 5 freq vibrates (1) - 4 freq violated (2) - 2 freq vibrato (2) - 1 freq vibratin (2) - 2 freq pirated (2) - 1 freq vibrator (2) - 1 freq liberated (2) - 3 freq braved (3) - 1 freq nitrate (3) - 1 freq inated (3) - 1 freq curated (3) - 1 freq operated (3) - 5 freq situated (3) - 3 freq embraked (3) - 1 freq embraced (3) - 7 freq berated (3) - 1 freq dilated (3) - 1 freq pirates (3) - 7 freq virused (3) - 1 freq irate (3) - 1 freq pirate (3) - 6 freq rated (3) - 3 freq irrate (3) - 1 freq |
vibrated (0) - 1 freq vibrates (2) - 4 freq vibrate (2) - 5 freq vibrator (3) - 1 freq liberated (3) - 3 freq vibrato (3) - 1 freq vibratin (3) - 2 freq overrated (4) - 2 freq berated (4) - 1 freq pirated (4) - 1 freq violated (4) - 2 freq vibration (4) - 4 freq airted (5) - 31 freq vibrant (5) - 16 freq debated (5) - 3 freq braced (5) - 1 freq serrated (5) - 1 freq abated (5) - 1 freq braked (5) - 1 freq gyrated (5) - 1 freq aborted (5) - 1 freq evaporated (5) - 1 freq braed (5) - 5 freq grated (5) - 1 freq vibrantly (5) - 1 freq |
SoundEx code - V163 vibrate - 5 freq vibrations - 4 freq vibraitien's - 1 freq vibrates - 4 freq vibratin - 2 freq vibration - 4 freq viewforth - 4 freq vibrato - 1 freq vibrated - 1 freq vibrator - 1 freq |
MetaPhone code - FBRTT vibrated - 1 freq |
VIBRATED |
| Time to execute Levenshtein function - 0.252107 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.387682 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.030007 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.039700 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.001129 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. |