| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vibratin (0) - 2 freq vibration (1) - 4 freq vibrato (2) - 1 freq vibrated (2) - 1 freq vibrator (2) - 1 freq vibrations (2) - 4 freq vibrates (2) - 4 freq liberatin (2) - 2 freq vibrate (2) - 5 freq migratin (2) - 1 freq librarian (3) - 11 freq bravin (3) - 3 freq gibran (3) - 1 freq wiritin (3) - 1 freq gyratin (3) - 1 freq wirritin (3) - 1 freq embracin (3) - 7 freq vitamin (3) - 34 freq visitin (3) - 22 freq wirtin (3) - 2 freq airtin (3) - 36 freq virgin (3) - 34 freq debatin (3) - 3 freq firritin (3) - 1 freq dictatin (3) - 2 freq |
vibratin (0) - 2 freq vibration (1) - 4 freq vibrates (3) - 4 freq vibrate (3) - 5 freq vibrations (3) - 4 freq liberatin (3) - 2 freq vibrato (3) - 1 freq vibrator (3) - 1 freq vibrated (3) - 1 freq migratin (4) - 1 freq liberation (4) - 3 freq abatin (5) - 1 freq brain (5) - 172 freq hibernatin (5) - 6 freq batin (5) - 4 freq gratin (5) - 4 freq inebriatin (5) - 1 freq liberating (5) - 1 freq boatin (5) - 1 freq vibrant (5) - 16 freq brakin (5) - 15 freq ratin (5) - 1 freq leeberatin (5) - 1 freq avertin (5) - 1 freq britain (5) - 108 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 - FBRTN vibratin - 2 freq faburden - 1 freq |
VIBRATIN |
| Time to execute Levenshtein function - 0.242292 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.371955 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.033526 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.037801 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.000879 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. |