| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banger (0) - 5 freq bangor (1) - 9 freq danger (1) - 110 freq langer (1) - 227 freq banter (1) - 43 freq fanger (1) - 1 freq banged (1) - 26 freq sanger (1) - 1 freq banker (1) - 12 freq manger (1) - 11 freq bangers (1) - 3 freq badger (1) - 6 freq anger (1) - 73 freq ranger (1) - 8 freq baager (1) - 15 freq banner (1) - 19 freq hanger (1) - 3 freq ganger (1) - 1 freq singer (2) - 47 freq bunter (2) - 8 freq banned (2) - 35 freq ranter (2) - 1 freq maager (2) - 1 freq zander (2) - 43 freq barter (2) - 3 freq |
banger (0) - 5 freq bangor (1) - 9 freq anger (2) - 73 freq ranger (2) - 8 freq badger (2) - 6 freq banner (2) - 19 freq ganger (2) - 1 freq bangers (2) - 3 freq baager (2) - 15 freq hanger (2) - 3 freq banter (2) - 43 freq manger (2) - 11 freq danger (2) - 110 freq fanger (2) - 1 freq langer (2) - 227 freq sanger (2) - 1 freq banged (2) - 26 freq banker (2) - 12 freq bang (3) - 100 freq bungee (3) - 1 freq langir (3) - 7 freq tonger (3) - 1 freq yinger (3) - 2 freq ginger (3) - 121 freq bunged (3) - 7 freq |
SoundEx code - B526 bouncer - 24 freq bouncers - 5 freq bouncer's - 2 freq bangor - 9 freq bancouris - 1 freq bunker - 23 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 - BNJR bonjoor - 2 freq banger - 5 freq |
BANGER |
| Time to execute Levenshtein function - 0.218283 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.352791 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.028275 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.039880 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.000939 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. |