| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bingos (0) - 1 freq binges (1) - 1 freq bings (1) - 16 freq bing's (1) - 1 freq bingo (1) - 38 freq bangor (2) - 9 freq banghs (2) - 1 freq jingo (2) - 5 freq bins (2) - 34 freq biggs (2) - 4 freq king's (2) - 55 freq fingrs (2) - 1 freq mangos (2) - 1 freq bigots (2) - 4 freq kings (2) - 92 freq mingus (2) - 1 freq hing's (2) - 3 freq binge (2) - 4 freq bines (2) - 1 freq bigs (2) - 2 freq winos (2) - 2 freq bungs (2) - 1 freq big's (2) - 2 freq fings (2) - 10 freq gings (2) - 75 freq |
bingos (0) - 1 freq bings (1) - 16 freq binges (1) - 1 freq bungs (2) - 1 freq bangs (2) - 13 freq beings (2) - 4 freq bingo (2) - 38 freq bing's (2) - 1 freq wings (3) - 131 freq singis (3) - 1 freq brings (3) - 116 freq binns (3) - 2 freq binds (3) - 7 freq hinges (3) - 19 freq tings (3) - 23 freq rings (3) - 112 freq bing (3) - 38 freq jings (3) - 169 freq bannos (3) - 1 freq hings (3) - 298 freq dings (3) - 16 freq pings (3) - 4 freq lings (3) - 5 freq kingis (3) - 2 freq banjos (3) - 2 freq |
SoundEx code - B522 banshee's - 2 freq benshees - 2 freq bunches - 7 freq benches - 13 freq bounces - 4 freq banshees - 6 freq benkis - 1 freq banjos - 2 freq binges - 1 freq 'banshees' - 1 freq bingos - 1 freq boonces - 4 freq 'boonce's - 1 freq boonce's - 3 freq boneshaker - 1 freq bunghsie - 2 freq banghs - 1 freq bonxie's - 1 freq bangkok - 2 freq bianco's - 1 freq benjy's - 1 freq bonsais - 1 freq bonxies - 4 freq boom-cognate-boom-hum-end-o-game - 1 freq bnqyikqq - 1 freq |
MetaPhone code - BNKS banks - 132 freq bannocks - 42 freq bungs - 1 freq bings - 16 freq bangs - 13 freq baunks - 6 freq benkis - 1 freq binks - 7 freq beings - 4 freq bannacks - 2 freq bunks - 4 freq bingos - 1 freq binnacks - 1 freq bonxie - 8 freq benks - 2 freq bannock's - 1 freq bing's - 1 freq bianco's - 1 freq bunksy - 1 freq bunksy - 1 freq |
BINGOS |
| Time to execute Levenshtein function - 0.224664 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.407292 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.027851 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.037583 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.000932 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. |