| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bangin (0) - 40 freq bargin (1) - 2 freq gangin (1) - 72 freq bungin (1) - 3 freq bangan (1) - 1 freq hangin (1) - 29 freq banging (1) - 9 freq bingin (1) - 1 freq bannin (1) - 5 freq langin (1) - 7 freq dangin (1) - 1 freq rangin (1) - 2 freq baegin (1) - 2 freq bankin (1) - 19 freq mangin (1) - 13 freq baggin (1) - 2 freq pangit (2) - 6 freq blankin (2) - 1 freq angina (2) - 3 freq bonkin (2) - 1 freq cantin (2) - 4 freq ringin (2) - 41 freq ballin (2) - 3 freq barrin (2) - 7 freq ryngin (2) - 1 freq |
bangin (0) - 40 freq bingin (1) - 1 freq bungin (1) - 3 freq bangan (1) - 1 freq rangin (2) - 2 freq mangin (2) - 13 freq baegin (2) - 2 freq bankin (2) - 19 freq dangin (2) - 1 freq baggin (2) - 2 freq gangin (2) - 72 freq langin (2) - 7 freq bargin (2) - 2 freq hangin (2) - 29 freq banging (2) - 9 freq bannin (2) - 5 freq bendin (3) - 14 freq bargain (3) - 33 freq pingin (3) - 2 freq bang (3) - 97 freq buntin (3) - 4 freq biggin (3) - 208 freq baegun (3) - 6 freq banged (3) - 26 freq beggin (3) - 33 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 - BNJN bangin - 40 freq bungin - 3 freq bingin - 1 freq |
BANGIN |
| Time to execute Levenshtein function - 0.203857 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.336554 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.027575 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.037010 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.000848 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. |