| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dribs (0) - 3 freq ribs (1) - 33 freq dries (1) - 8 freq drips (1) - 5 freq cribs (1) - 1 freq daies (2) - 2 freq rits (2) - 1 freq cries (2) - 101 freq brigs (2) - 19 freq tribes (2) - 24 freq brits (2) - 5 freq grids (2) - 1 freq dirs (2) - 28 freq dies (2) - 7 freq probs (2) - 8 freq driet (2) - 2 freq deils (2) - 35 freq fries (2) - 3 freq dumbs (2) - 1 freq drab (2) - 7 freq vries (2) - 1 freq ris (2) - 41 freq dois (2) - 3 freq drams (2) - 28 freq drains (2) - 10 freq |
dribs (0) - 3 freq ribs (2) - 33 freq drips (2) - 5 freq cribs (2) - 1 freq dries (2) - 8 freq rubs (3) - 10 freq drops (3) - 18 freq drags (3) - 8 freq dreids (3) - 2 freq draws (3) - 31 freq dbis (3) - 1 freq duirs (3) - 5 freq drives (3) - 27 freq crubs (3) - 2 freq dubs (3) - 84 freq dress (3) - 98 freq derbies (3) - 2 freq drems (3) - 1 freq debs (3) - 1 freq bribes (3) - 2 freq dross (3) - 18 freq drees (3) - 6 freq draigs (3) - 1 freq dabs (3) - 5 freq drars (3) - 2 freq |
SoundEx code - D612 dreeps - 13 freq droves - 10 freq dribs - 3 freq draps - 62 freq drops - 18 freq drives - 27 freq drops' - 1 freq dwarves - 6 freq dwarvies - 5 freq dwarvies' - 1 freq dervish - 2 freq dervishes - 1 freq drap's - 1 freq draabak - 1 freq draabaak - 1 freq dwarfs - 5 freq drips - 5 freq droaps - 4 freq drive's - 1 freq driveways - 2 freq drops'll - 1 freq drivas - 1 freq drawbacks - 2 freq derives - 10 freq drabbest - 1 freq drapes - 6 freq draabacks - 1 freq draaback - 2 freq droppis - 1 freq drappies - 2 freq dropsey - 1 freq drybowks - 1 freq dervock - 1 freq derbies - 2 freq drap-kickin - 1 freq |
MetaPhone code - TRBS tribes - 24 freq dribs - 3 freq turbos - 2 freq teribus - 1 freq derbies - 2 freq |
DRIBS |
| Time to execute Levenshtein function - 0.260552 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.364782 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.032743 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.057842 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.000975 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. |