Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bouncing (0) - 5 freq bouncin (1) - 12 freq bounding (1) - 1 freq bounin (2) - 1 freq boundin (2) - 7 freq bonding (2) - 1 freq pounding (2) - 1 freq counting (2) - 4 freq duncing (2) - 3 freq booncin (2) - 10 freq sounding (2) - 1 freq bunting (2) - 8 freq courting (3) - 3 freq bringing (3) - 16 freq fouling (3) - 1 freq bounces (3) - 4 freq doungang (3) - 1 freq boufin (3) - 3 freq boubcibf (3) - 1 freq bowing (3) - 1 freq bottling (3) - 2 freq bogging (3) - 2 freq poundin (3) - 12 freq browning (3) - 7 freq haunting (3) - 3 freq |
bouncing (0) - 5 freq bouncin (2) - 12 freq bounding (2) - 1 freq bunting (3) - 8 freq bonding (3) - 1 freq duncing (3) - 3 freq booncin (3) - 10 freq dancing (4) - 31 freq banning (4) - 2 freq fencing (4) - 1 freq bending (4) - 2 freq banging (4) - 10 freq banking (4) - 3 freq binding (4) - 1 freq bounin (4) - 1 freq pounding (4) - 1 freq boundin (4) - 7 freq counting (4) - 4 freq sounding (4) - 1 freq bowling (5) - 1 freq dunning (5) - 1 freq bunchin (5) - 1 freq poncin (5) - 1 freq boondin (5) - 1 freq buzzing (5) - 11 freq |
SoundEx code - B525 b'makkin - 1 freq banging - 10 freq bouncing - 5 freq bankin - 19 freq bankins - 2 freq bouncin - 12 freq bangin - 41 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.208640 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.367669 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.028086 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.038481 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.000926 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. |