| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bangor (0) - 9 freq banger (1) - 5 freq ranger (2) - 8 freq bannos (2) - 1 freq fanger (2) - 1 freq manor (2) - 4 freq bingos (2) - 1 freq bator (2) - 1 freq langer (2) - 223 freq bingo (2) - 38 freq baager (2) - 15 freq bangin (2) - 40 freq langir (2) - 7 freq hanger (2) - 3 freq mangoo (2) - 1 freq mangos (2) - 1 freq manger (2) - 11 freq anger (2) - 68 freq bangu (2) - 1 freq banner (2) - 19 freq sanger (2) - 1 freq ganger (2) - 1 freq ang'r (2) - 2 freq cantor (2) - 1 freq bangkok (2) - 2 freq |
bangor (0) - 9 freq banger (1) - 5 freq banker (3) - 12 freq ganger (3) - 1 freq danger (3) - 109 freq banner (3) - 19 freq bangu (3) - 1 freq bangers (3) - 3 freq sanger (3) - 1 freq bangan (3) - 1 freq banter (3) - 43 freq bang (3) - 97 freq bangs (3) - 13 freq bangle (3) - 1 freq anger (3) - 68 freq badger (3) - 6 freq banged (3) - 26 freq bingo (3) - 38 freq baager (3) - 15 freq langer (3) - 223 freq bingos (3) - 1 freq manger (3) - 11 freq ranger (3) - 8 freq bangin (3) - 40 freq fanger (3) - 1 freq |
SoundEx code - B526 bouncer - 22 freq bouncers - 5 freq bouncer's - 2 freq bangor - 9 freq bancouris - 1 freq bunker - 22 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 - BNKR bangor - 9 freq bunker - 22 freq banker - 12 freq bunkery - 2 freq bunker' - 1 freq |
BANGOR |
| Time to execute Levenshtein function - 0.188000 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.342653 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.027097 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.037274 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.000943 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. |