| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bouncin (0) - 11 freq bounin (1) - 1 freq booncin (1) - 10 freq boundin (1) - 7 freq bouncing (1) - 5 freq bungin (2) - 3 freq bouffin (2) - 1 freq bouncer (2) - 22 freq bounding (2) - 1 freq bounce (2) - 23 freq buntin (2) - 4 freq woundin (2) - 1 freq bourdin (2) - 1 freq chuncin (2) - 1 freq council (2) - 58 freq soundin (2) - 8 freq bondin (2) - 1 freq bounced (2) - 12 freq bounces (2) - 4 freq countin (2) - 13 freq boonsin (2) - 1 freq bunchin (2) - 1 freq brunnin (2) - 1 freq bonkin (2) - 1 freq boondin (2) - 1 freq |
bouncin (0) - 11 freq booncin (1) - 10 freq boundin (2) - 7 freq bouncing (2) - 5 freq bounin (2) - 1 freq bunchin (3) - 1 freq boonsin (3) - 1 freq bounces (3) - 4 freq bonkin (3) - 1 freq booncie (3) - 1 freq dauncin (3) - 28 freq duncin (3) - 23 freq bondin (3) - 1 freq bouncy (3) - 7 freq poncin (3) - 1 freq boondin (3) - 1 freq bounced (3) - 12 freq buntin (3) - 4 freq bounce (3) - 23 freq bungin (3) - 3 freq bouncer (3) - 22 freq buncha (4) - 2 freq bingin (4) - 1 freq bunc (4) - 1 freq booncy (4) - 11 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 - BNSN bouncin - 11 freq booncin - 10 freq bunsen - 28 freq boonsin - 1 freq boonsin' - 1 freq benisoun - 1 freq benson - 1 freq |
BOUNCIN |
| Time to execute Levenshtein function - 0.476058 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.732507 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.075753 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.037026 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.000832 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. |