| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dubbiest (0) - 1 freq dobbies (2) - 2 freq dumbies (2) - 1 freq dubbie (2) - 7 freq chubbiest (2) - 1 freq grubbiest (2) - 1 freq dunkies (3) - 1 freq biest (3) - 1 freq bobbies (3) - 31 freq derbies (3) - 2 freq drabbest (3) - 1 freq rubies (3) - 4 freq cabbies (3) - 1 freq cubbie (3) - 2 freq luckiest (3) - 2 freq dumbit (3) - 1 freq rubbert (3) - 2 freq hobbies (3) - 8 freq bubbles (3) - 23 freq pubbie (3) - 1 freq jobbies (3) - 3 freq duist (3) - 1 freq busiest (3) - 3 freq dubble (3) - 2 freq bobbies' (3) - 1 freq |
dubbiest (0) - 1 freq dobbies (3) - 2 freq dabbit (4) - 6 freq drabbest (4) - 1 freq sibbest (4) - 1 freq grubbiest (4) - 1 freq dubbie (4) - 7 freq chubbiest (4) - 1 freq dumbies (4) - 1 freq babbies (5) - 13 freq hubbert (5) - 1 freq debbie's (5) - 1 freq rubbit (5) - 49 freq debbie (5) - 2 freq nibbies (5) - 1 freq driest (5) - 7 freq dubbin (5) - 1 freq dobbie (5) - 1 freq mebbies (5) - 58 freq lobbies (5) - 3 freq dowiest (5) - 1 freq mibbies (5) - 18 freq gebbies (5) - 1 freq rubbish (5) - 67 freq briest (5) - 5 freq |
SoundEx code - D123 deepest - 17 freq deposit - 5 freq devastated - 2 freq dovizdane - 1 freq devisit - 4 freq dipicten - 1 freq deficit - 10 freq devastate - 2 freq deep-seatit - 1 freq divestin - 1 freq defect - 1 freq depicts - 2 freq devistatin - 1 freq deposited - 2 freq depository - 2 freq deep-stowed - 1 freq defects - 1 freq devastation - 3 freq depictit - 4 freq dvstit - 1 freq debased - 1 freq dovecot - 4 freq diffused - 2 freq depiction - 3 freq depictions - 2 freq depicted - 1 freq devastating - 2 freq depositing - 1 freq defecting - 2 freq dubbiest - 1 freq deep-set - 1 freq deepcut - 1 freq devastatit - 1 freq deposits - 3 freq devised - 1 freq difzcidro - 1 freq dpjhodges - 2 freq de-facto - 1 freq dypgt - 1 freq dipstick - 3 freq dipsticks - 1 freq |
MetaPhone code - TBST debased - 1 freq dubbiest - 1 freq |
DUBBIEST |
| Time to execute Levenshtein function - 0.212141 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.363104 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.027741 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.037859 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.000798 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. |