| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dobbin (0) - 13 freq fobbin (1) - 3 freq dobbie (1) - 1 freq robbin (1) - 5 freq dubbin (1) - 1 freq mobbin (1) - 1 freq bobbin (1) - 21 freq dobbid (1) - 1 freq dabbin (1) - 7 freq sobbin (1) - 9 freq lobbin (1) - 4 freq nebbin (2) - 1 freq rubbin (2) - 48 freq cobain (2) - 1 freq bebbin (2) - 1 freq doin (2) - 74 freq dookin (2) - 20 freq jobbie (2) - 17 freq wabbin (2) - 1 freq dublin (2) - 29 freq robbit (2) - 2 freq robbie (2) - 61 freq dozin (2) - 8 freq 'dobbin' (2) - 1 freq stobbin (2) - 1 freq |
dobbin (0) - 13 freq dubbin (1) - 1 freq dabbin (1) - 7 freq dobbid (2) - 1 freq sobbin (2) - 9 freq bobbin (2) - 21 freq lobbin (2) - 4 freq mobbin (2) - 1 freq fobbin (2) - 3 freq dobbie (2) - 1 freq robbin (2) - 5 freq bobban (3) - 2 freq dibblin (3) - 1 freq boabin (3) - 1 freq dabbit (3) - 6 freq boabbin (3) - 1 freq doubtin (3) - 3 freq dobbies (3) - 2 freq dumbin (3) - 2 freq babbin (3) - 4 freq dobson (3) - 4 freq jabbin (3) - 7 freq gobban (3) - 1 freq dybin (3) - 1 freq nabbin (3) - 2 freq |
SoundEx code - D150 divna - 35 freq deavin - 8 freq divine - 29 freq daffin - 18 freq dabbin - 7 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 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 - 7 freq tubin - 1 freq 'dobbin' - 1 freq dobbin - 13 freq dybin - 1 freq dubbin - 1 freq dbn - 1 freq |
DOBBIN |
| Time to execute Levenshtein function - 0.211883 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.400796 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.028254 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.036635 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.000852 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. |