| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bouncer (0) - 22 freq ouncer (1) - 1 freq bounced (1) - 12 freq bounce (1) - 23 freq bouncers (1) - 5 freq bounces (1) - 4 freq ounces (2) - 1 freq bunker (2) - 22 freq buncher (2) - 1 freq bunter (2) - 8 freq bouned (2) - 3 freq dauncer (2) - 11 freq bouncy (2) - 7 freq boonces (2) - 4 freq bouster (2) - 1 freq rouner (2) - 2 freq baunner (2) - 5 freq bucer (2) - 1 freq bunder (2) - 1 freq chuncer (2) - 3 freq pounced (2) - 1 freq bouncer's (2) - 2 freq sounder (2) - 2 freq concer (2) - 1 freq bounded (2) - 7 freq |
bouncer (0) - 22 freq bouncers (2) - 5 freq bounce (2) - 23 freq bounces (2) - 4 freq bounced (2) - 12 freq ouncer (2) - 1 freq booncers (3) - 2 freq bonce (3) - 1 freq bunder (3) - 1 freq bouncin (3) - 11 freq bucer (3) - 1 freq boonced (3) - 20 freq boonce (3) - 61 freq baunner (3) - 5 freq duncer (3) - 6 freq bonnier (3) - 24 freq concer (3) - 1 freq bunter (3) - 8 freq bunker (3) - 22 freq boonces (3) - 4 freq bouncy (3) - 7 freq buncher (3) - 1 freq dauncer (3) - 11 freq banker (4) - 12 freq bunch (4) - 105 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 - BNSR bouncer - 22 freq banesair - 1 freq |
BOUNCER |
| Time to execute Levenshtein function - 0.287638 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.388650 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.027134 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.036861 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.000880 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. |