| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunkery (0) - 2 freq bunkers (1) - 12 freq bunker (1) - 23 freq bunker' (1) - 1 freq bonkers (2) - 5 freq burker (2) - 2 freq burkers (2) - 2 freq bunchry (2) - 1 freq buskers (2) - 2 freq bakery (2) - 16 freq banker (2) - 12 freq buggery (2) - 11 freq hunkert (2) - 20 freq hunkers (2) - 11 freq cuikery (2) - 1 freq busker (2) - 2 freq bulker (2) - 1 freq unker (2) - 4 freq bankers (2) - 4 freq bunksy (2) - 1 freq bunder (2) - 1 freq hunker (2) - 12 freq buttery (2) - 24 freq bunter (2) - 8 freq dunkey (2) - 19 freq |
bunkery (0) - 2 freq bunker (1) - 23 freq banker (2) - 12 freq bunker' (2) - 1 freq bunkers (2) - 12 freq unker (3) - 4 freq bulker (3) - 1 freq bankers (3) - 4 freq bunder (3) - 1 freq bunter (3) - 8 freq hunker (3) - 12 freq bunksy (3) - 1 freq busker (3) - 2 freq bonkers (3) - 5 freq bakery (3) - 16 freq burker (3) - 2 freq tinker (4) - 21 freq baiker (4) - 1 freq bunkum (4) - 1 freq tanker (4) - 4 freq linker (4) - 1 freq binder (4) - 23 freq canker (4) - 4 freq hanker (4) - 3 freq byker (4) - 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 - BNKR bangor - 9 freq bunker - 23 freq banker - 12 freq bunkery - 2 freq bunker' - 1 freq |
BUNKERY |
| Time to execute Levenshtein function - 0.211817 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.417207 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.028932 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.039417 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.000953 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. |