| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bouncing (0) - 5 freq bounding (1) - 1 freq bouncin (1) - 11 freq bonding (2) - 1 freq counting (2) - 4 freq duncing (2) - 3 freq booncin (2) - 10 freq bunting (2) - 8 freq pounding (2) - 1 freq bounin (2) - 1 freq boundin (2) - 7 freq boring (3) - 13 freq booking (3) - 5 freq boking (3) - 1 freq bunchin (3) - 1 freq poundin (3) - 12 freq tuning (3) - 3 freq banking (3) - 3 freq dauncin (3) - 28 freq bottling (3) - 2 freq chancing (3) - 2 freq dauncin' (3) - 1 freq brounin (3) - 1 freq touching (3) - 6 freq booncie (3) - 1 freq |
bouncing (0) - 5 freq bouncin (2) - 11 freq bounding (2) - 1 freq bunting (3) - 8 freq duncing (3) - 3 freq booncin (3) - 10 freq bonding (3) - 1 freq banging (4) - 9 freq bending (4) - 2 freq banning (4) - 2 freq binding (4) - 1 freq dancing (4) - 30 freq banking (4) - 3 freq fencing (4) - 1 freq bounin (4) - 1 freq boundin (4) - 7 freq pounding (4) - 1 freq counting (4) - 4 freq bringing (5) - 15 freq haunting (5) - 3 freq wunting (5) - 1 freq blinking (5) - 2 freq dunning (5) - 1 freq boeing (5) - 1 freq punching (5) - 1 freq |
SoundEx code - B525 b'makkin - 1 freq banging - 9 freq bouncing - 5 freq bankin - 19 freq bankins - 2 freq bouncin - 11 freq bangin - 40 freq benjamin - 7 freq bungin - 3 freq banishment - 3 freq bainishment - 1 freq bannisment - 1 freq bemusement - 2 freq booncin - 10 freq binkin - 1 freq bunsen - 28 freq bunsen's - 4 freq bonkin - 1 freq bone-joints - 1 freq bangan - 1 freq bingin - 1 freq bankeen - 1 freq benign - 2 freq benchmairkin - 1 freq boonsin - 1 freq boonsin' - 1 freq baneshanks - 1 freq benisoun - 1 freq benchmark - 1 freq benson - 1 freq bunchin - 1 freq bmxing - 2 freq bankin' - 1 freq banks-wint - 1 freq banking - 3 freq benzema - 1 freq benjynthemonkey - 2 freq bunkum - 1 freq bingowings - 1 freq banknockb - 1 freq benmcgowan - 1 freq bonessunited - 2 freq bonessunitedcfc - 1 freq bencanteach - 1 freq |
MetaPhone code - BNSNK bouncing - 5 freq |
BOUNCING |
| Time to execute Levenshtein function - 0.180601 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.349892 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.027816 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.043308 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.000806 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. |