Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dubbin (0) - 1 freq dobbin (1) - 13 freq dumbin (1) - 2 freq dubbie (1) - 7 freq dublin (1) - 29 freq dabbin (1) - 8 freq rubbin (1) - 50 freq gubbin (1) - 3 freq dubble (2) - 2 freq wabbin (2) - 1 freq dubbed (2) - 3 freq dybin (2) - 1 freq dumpin (2) - 5 freq jabbin (2) - 8 freq debbie (2) - 2 freq rubbir (2) - 1 freq babbin (2) - 4 freq dustin (2) - 12 freq dumbit (2) - 1 freq dullin (2) - 2 freq pubbie (2) - 1 freq rubbing (2) - 3 freq bobbin (2) - 22 freq dun-in (2) - 1 freq dibblin (2) - 1 freq |
dubbin (0) - 1 freq dabbin (1) - 8 freq dobbin (1) - 13 freq dubbie (2) - 7 freq rubbin (2) - 50 freq gubbin (2) - 3 freq dublin (2) - 29 freq dumbin (2) - 2 freq sobbin (3) - 10 freq dabbit (3) - 6 freq bebbin (3) - 1 freq ebbin (3) - 3 freq dubby (3) - 12 freq dobbie (3) - 1 freq doubtin (3) - 3 freq nabbin (3) - 2 freq sabbin (3) - 10 freq gabbin (3) - 19 freq nebbin (3) - 2 freq robbin (3) - 6 freq ribbin (3) - 2 freq dobbid (3) - 1 freq mobbin (3) - 1 freq doublin (3) - 6 freq lobbin (3) - 4 freq |
SoundEx code - D150 divna - 35 freq deavin - 8 freq divine - 29 freq daffin - 18 freq dabbin - 8 freq dippin - 10 freq divven - 1 freq deivin - 1 freq 'dobbin' - 1 freq dobbin - 13 freq divin - 13 freq devine - 3 freq divan - 1 freq dvon - 1 freq divvin - 1 freq dovin - 2 freq defen - 1 freq defyin - 2 freq deevin - 4 freq divnae - 5 freq define - 11 freq dupin - 1 freq davina - 9 freq devon - 4 freq deepen - 6 freq dab-haun - 1 freq deivan - 1 freq doffin - 2 freq dauphin - 1 freq depone - 3 freq defyan - 1 freq divvyin - 1 freq devana - 1 freq dowp-en - 1 freq daphne - 7 freq divn - 1 freq doiwpin - 1 freq dowpin - 1 freq dybin - 1 freq dubbin - 1 freq dievin - 1 freq dbn - 1 freq defn - 3 freq davehun - 1 freq dpn - 1 freq |
MetaPhone code - TBN dabbin - 8 freq tubin - 1 freq 'dobbin' - 1 freq dobbin - 13 freq dybin - 1 freq dubbin - 1 freq dbn - 1 freq |
DUBBIN |
Time to execute Levenshtein function - 0.214794 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.363431 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.031313 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.042217 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.000929 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. |