| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonbons (0) - 3 freq bunions (2) - 2 freq bonns (2) - 2 freq bosons (2) - 1 freq onions (2) - 17 freq bonjoor (3) - 2 freq bonkers (3) - 5 freq foons (3) - 7 freq motions (3) - 17 freq onion (3) - 14 freq fonns (3) - 1 freq cannons (3) - 7 freq poons (3) - 1 freq boab's (3) - 3 freq lountons (3) - 1 freq bob's (3) - 4 freq bools (3) - 23 freq minions (3) - 5 freq coyboys (3) - 1 freq lonns (3) - 1 freq boness (3) - 3 freq bobs (3) - 9 freq bobbies (3) - 33 freq cabons (3) - 1 freq bobbles (3) - 1 freq |
bonbons (0) - 3 freq bonns (3) - 2 freq bunions (3) - 2 freq bankins (4) - 2 freq bindins (4) - 1 freq bannos (4) - 1 freq binns (4) - 2 freq banns (4) - 3 freq onions (4) - 17 freq bosons (4) - 1 freq bones (5) - 61 freq boppins (5) - 1 freq bonnets (5) - 5 freq ribbons (5) - 33 freq batons (5) - 1 freq buttons (5) - 57 freq bombin (5) - 4 freq bobbin (5) - 22 freq boomins (5) - 1 freq gobbins (5) - 3 freq notions (5) - 40 freq bonkin (5) - 1 freq boonds (5) - 7 freq robins (5) - 1 freq bingos (5) - 1 freq |
SoundEx code - B515 bumpin - 9 freq bombin - 4 freq boom-boom-boomin - 1 freq bombing - 2 freq bampin - 1 freq bonbons - 3 freq boom-boom-boom - 1 freq beeinmabonnet - 1 freq bumping - 1 freq |
MetaPhone code - BNBNS bonbons - 3 freq |
BONBONS |
| Time to execute Levenshtein function - 0.241273 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.586960 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.055543 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.078133 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.001291 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. |