| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dobber (0) - 4 freq dabber (1) - 3 freq robber (1) - 3 freq dibber (1) - 2 freq rubber (2) - 54 freq dodger (2) - 5 freq dowser (2) - 1 freq dabbed (2) - 9 freq robbery (2) - 8 freq bobbed (2) - 1 freq hubber (2) - 1 freq cobbler (2) - 2 freq dooter (2) - 3 freq lobbed (2) - 6 freq clobber (2) - 6 freq donder (2) - 2 freq dubbed (2) - 2 freq bobbler (2) - 3 freq jobbed (2) - 1 freq dourer (2) - 2 freq sober (2) - 26 freq cobler (2) - 1 freq downer (2) - 1 freq dowter (2) - 8 freq robbed (2) - 16 freq |
dobber (0) - 4 freq dibber (1) - 2 freq dabber (1) - 3 freq robber (2) - 3 freq doobler (3) - 1 freq dobbid (3) - 1 freq dabbers (3) - 1 freq dobbie (3) - 1 freq dobbin (3) - 13 freq dubbed (3) - 2 freq jabber (3) - 4 freq dobbies (3) - 2 freq doubler (3) - 6 freq hubber (3) - 1 freq dabbed (3) - 9 freq rubber (3) - 54 freq robbery (3) - 8 freq dubbie (4) - 7 freq dodger (4) - 5 freq dogger (4) - 1 freq dover (4) - 15 freq lobbed (4) - 6 freq comber (4) - 2 freq robbers (4) - 7 freq gobbed (4) - 3 freq |
SoundEx code - D160 deeper - 51 freq dover - 15 freq duffer - 6 freq differ - 135 freq dapper - 4 freq diver - 5 freq dafferie - 4 freq dyvor - 1 freq daffery - 2 freq dobber - 4 freq devour' - 1 freq dowper - 4 freq dover' - 1 freq dhofar - 1 freq 'dafferie - 1 freq deiffer - 2 freq daiver - 4 freq deefer - 1 freq dyvour - 2 freq dibber - 2 freq dabber - 3 freq devour - 7 freq dipper - 3 freq devoir - 1 freq deepur - 1 freq difer - 2 freq dfr - 2 freq dwfywri - 1 freq |
MetaPhone code - TBR dobber - 4 freq tibur - 2 freq tiber - 1 freq tea-barra - 1 freq tuber - 1 freq tobar - 2 freq dibber - 2 freq dabber - 3 freq tabor - 1 freq wdbhr - 1 freq |
DOBBER |
| Time to execute Levenshtein function - 0.228554 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.367426 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.031799 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.036780 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.000765 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. |