| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunkers (0) - 12 freq buskers (1) - 2 freq bonkers (1) - 5 freq bunker' (1) - 1 freq hunkers (1) - 11 freq bunkery (1) - 2 freq burkers (1) - 2 freq bunker (1) - 23 freq bankers (1) - 4 freq wurkers (2) - 6 freq bunter (2) - 8 freq hunkert (2) - 20 freq bangers (2) - 3 freq tankers (2) - 2 freq banker (2) - 12 freq bunnets (2) - 9 freq runners (2) - 9 freq winkers (2) - 1 freq unkens (2) - 1 freq sunkets (2) - 2 freq burners (2) - 7 freq backers (2) - 2 freq plunkers (2) - 1 freq buyers (2) - 6 freq boskers (2) - 2 freq |
bunkers (0) - 12 freq bankers (1) - 4 freq bonkers (1) - 5 freq burkers (2) - 2 freq buskers (2) - 2 freq bunker (2) - 23 freq bunker' (2) - 1 freq bunkery (2) - 2 freq hunkers (2) - 11 freq younkers (3) - 9 freq bunks (3) - 4 freq bakers (3) - 24 freq conkers (3) - 3 freq binders (3) - 1 freq boskers (3) - 2 freq wankers (3) - 5 freq minkers (3) - 3 freq tinkers (3) - 4 freq jinkers (3) - 1 freq brokers (3) - 2 freq bikers (3) - 2 freq bouncers (3) - 5 freq banners (3) - 15 freq banker (3) - 12 freq beakers (3) - 1 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 - BNKRS bancouris - 1 freq bonkers - 5 freq bunkers - 12 freq bankers - 4 freq |
BUNKERS |
| Time to execute Levenshtein function - 0.186259 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.345997 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.028826 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.037133 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.000872 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. |