| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zerubbabel (0) - 7 freq rubbage (4) - 4 freq prubbably (4) - 1 freq verbal (5) - 28 freq prubablee (5) - 1 freq grubbed (5) - 1 freq beremael (5) - 1 freq scrubban (5) - 1 freq cerebral (5) - 1 freq cribbage (5) - 2 freq rubble (5) - 7 freq verball (5) - 1 freq babel (5) - 7 freq hertbraken (5) - 1 freq rubbed (5) - 42 freq 'rubber (5) - 1 freq scrubbles (5) - 1 freq jerusalem (5) - 103 freq rubbled (5) - 1 freq trubbul (5) - 1 freq herbal (5) - 5 freq rubber (5) - 54 freq carysabel (5) - 1 freq bernabeu (5) - 1 freq scrubbed (5) - 6 freq |
zerubbabel (0) - 7 freq prubbably (5) - 1 freq trubble (7) - 2 freq rubble (7) - 7 freq trubbul (7) - 1 freq prubablee (7) - 1 freq rubbage (7) - 4 freq tribbil (8) - 2 freq carysabel (8) - 1 freq herbal (8) - 5 freq drebble (8) - 1 freq rubban (8) - 3 freq bubble (8) - 30 freq dribble (8) - 3 freq probably (8) - 254 freq tribble (8) - 31 freq rubbled (8) - 1 freq rabble (8) - 10 freq rubber (8) - 54 freq grubbed (8) - 1 freq probable (8) - 4 freq cribbage (8) - 2 freq cerebral (8) - 1 freq babel (8) - 7 freq verball (8) - 1 freq |
SoundEx code - Z611 zerubbabel - 7 freq |
MetaPhone code - SRBBL zerubbabel - 7 freq |
ZERUBBABEL |
| Time to execute Levenshtein function - 0.184348 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.370956 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.027513 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.037297 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.000848 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. |