| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bankers (0) - 4 freq bangers (1) - 3 freq wankers (1) - 5 freq backers (1) - 2 freq bunkers (1) - 12 freq tankers (1) - 2 freq bonkers (1) - 5 freq banker (1) - 12 freq bakers (1) - 24 freq banners (1) - 15 freq binders (2) - 1 freq landers (2) - 10 freq maakers (2) - 3 freq jinkers (2) - 1 freq banked (2) - 2 freq banks (2) - 132 freq hackers (2) - 1 freq wanders (2) - 6 freq spankers (2) - 2 freq barbers (2) - 3 freq conkers (2) - 3 freq mackers (2) - 1 freq boskers (2) - 2 freq bunkery (2) - 2 freq buskers (2) - 2 freq |
bankers (0) - 4 freq bonkers (1) - 5 freq bunkers (1) - 12 freq banners (2) - 15 freq bakers (2) - 24 freq banker (2) - 12 freq tankers (2) - 2 freq wankers (2) - 5 freq backers (2) - 2 freq bangers (2) - 3 freq brokers (3) - 2 freq minkers (3) - 3 freq bikers (3) - 2 freq burkers (3) - 2 freq benders (3) - 1 freq bankins (3) - 2 freq hunkers (3) - 11 freq buskers (3) - 2 freq winkers (3) - 1 freq bunker (3) - 23 freq beakers (3) - 1 freq tinkers (3) - 4 freq bunker' (3) - 1 freq blinkers (3) - 4 freq bunkery (3) - 2 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 |
BANKERS |
| Time to execute Levenshtein function - 0.203031 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.427750 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.028226 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.039758 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.000929 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. |