| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bobbin (0) - 22 freq bebbin (1) - 1 freq sobbin (1) - 10 freq mobbin (1) - 1 freq lobbin (1) - 4 freq babbin (1) - 4 freq robbin (1) - 6 freq bobbie (1) - 15 freq boabin (1) - 1 freq dobbin (1) - 13 freq bobban (1) - 2 freq fobbin (1) - 3 freq boabbin (1) - 1 freq bobbit (1) - 2 freq bombin (1) - 4 freq bobin (1) - 1 freq robbie (2) - 61 freq jobbie (2) - 17 freq roabin (2) - 1 freq boufin (2) - 3 freq gobbins (2) - 3 freq bowin (2) - 8 freq gubbin (2) - 3 freq boffin (2) - 2 freq sobban (2) - 4 freq |
bobbin (0) - 22 freq babbin (1) - 4 freq bebbin (1) - 1 freq bobban (1) - 2 freq boabbin (1) - 1 freq fobbin (2) - 3 freq bobbit (2) - 2 freq bobin (2) - 1 freq dobbin (2) - 13 freq bombin (2) - 4 freq sobbin (2) - 10 freq boabin (2) - 1 freq lobbin (2) - 4 freq mobbin (2) - 1 freq bobbie (2) - 15 freq robbin (2) - 6 freq sabbin (3) - 10 freq babbie (3) - 34 freq bibblin (3) - 2 freq bobby (3) - 45 freq dubbin (3) - 1 freq ribbin (3) - 2 freq dabbin (3) - 8 freq wabbin (3) - 1 freq blabbin (3) - 1 freq |
SoundEx code - B150 bowfin - 28 freq boabbin - 1 freq babbin - 4 freq bevvyin - 5 freq bobbin - 22 freq buffoon - 1 freq bowfin' - 1 freq bevyin - 1 freq bobban - 2 freq behavin - 4 freq bewvyin - 1 freq 'bowfin - 1 freq buffin' - 1 freq 'boffin' - 1 freq bevvin - 1 freq bovine - 2 freq byaavin - 1 freq byaaven - 1 freq baffin - 1 freq beivin - 1 freq bebbin - 1 freq bouffin - 1 freq boffin - 2 freq bowffin - 1 freq boppin - 1 freq boufin - 3 freq beepin - 3 freq bobin - 1 freq baboon - 1 freq befawin - 1 freq boabin - 1 freq bob-on - 1 freq |
MetaPhone code - BBN boabbin - 1 freq babbin - 4 freq bobbin - 22 freq bobban - 2 freq bebbin - 1 freq bobin - 1 freq baboon - 1 freq boabin - 1 freq bob-on - 1 freq |
BOBBIN |
| Time to execute Levenshtein function - 0.246147 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.400612 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.035385 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.045997 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.000930 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. |