| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| booncers (0) - 2 freq boonce's (1) - 3 freq boonces (1) - 4 freq bouncers (1) - 5 freq boonce (2) - 61 freq dooners (2) - 2 freq bonkers (2) - 5 freq bouncer's (2) - 2 freq foongers (2) - 1 freq boonless (2) - 1 freq oonces (2) - 3 freq boolers (2) - 1 freq coonters (2) - 1 freq boones (2) - 1 freq foonders (2) - 2 freq roonders (2) - 2 freq boonies (2) - 1 freq boozers (2) - 4 freq toonsers (2) - 6 freq bronzers (2) - 1 freq boolders (2) - 8 freq bouncer (2) - 22 freq boomers (2) - 1 freq 'boonce's (2) - 1 freq tooners (2) - 1 freq |
booncers (0) - 2 freq bouncers (1) - 5 freq boonces (2) - 4 freq boonce's (2) - 3 freq bounces (3) - 4 freq bouncer (3) - 22 freq bouncer's (3) - 2 freq bonkers (3) - 5 freq boomers (4) - 1 freq boonced (4) - 20 freq 'boonce's (4) - 1 freq dauncers (4) - 11 freq tooners (4) - 1 freq duncers (4) - 5 freq bangers (4) - 3 freq bunkers (4) - 12 freq benders (4) - 1 freq bankers (4) - 4 freq lancers (4) - 4 freq dancers (4) - 37 freq binders (4) - 1 freq banners (4) - 15 freq boolders (4) - 8 freq boolers (4) - 1 freq coonters (4) - 1 freq |
SoundEx code - B526 bouncer - 22 freq bouncers - 5 freq bouncer's - 2 freq bangor - 9 freq bancouris - 1 freq bunker - 22 freq 'banks're - 1 freq banker - 12 freq bonkers - 5 freq bunkery - 2 freq baungarrif - 1 freq bunkers - 12 freq 'bankrupt' - 1 freq bankers - 4 freq banchory - 6 freq bonjoor - 2 freq bankrupt - 8 freq banger - 5 freq bangers - 3 freq bin-cairt - 1 freq banesair - 1 freq ben-gurion - 1 freq buncher - 1 freq booncers - 2 freq bunchrew - 1 freq bangordub - 1 freq bomscare - 1 freq bin-hoker's - 1 freq bunchry - 1 freq bonaccordcentre - 3 freq bunker' - 1 freq banjorennie - 1 freq bankruptit - 1 freq |
MetaPhone code - BNSRS bouncers - 5 freq bouncer's - 2 freq booncers - 2 freq |
BOONCERS |
| Time to execute Levenshtein function - 0.211307 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.369885 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.028496 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.037451 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.000921 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. |