| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunker (0) - 23 freq bunter (1) - 8 freq banker (1) - 12 freq unker (1) - 4 freq hunker (1) - 12 freq burker (1) - 2 freq bunkers (1) - 12 freq bunkery (1) - 2 freq busker (1) - 2 freq bunder (1) - 1 freq bunker' (1) - 1 freq bulker (1) - 1 freq under (2) - 447 freq brucker (2) - 1 freq burkers (2) - 2 freq bosker (2) - 6 freq banked (2) - 2 freq bunksy (2) - 1 freq bouncer (2) - 24 freq busier (2) - 3 freq munkee (2) - 1 freq sinker (2) - 1 freq dunner (2) - 6 freq bunnel (2) - 1 freq binner (2) - 2 freq |
bunker (0) - 23 freq bunkery (1) - 2 freq banker (1) - 12 freq busker (2) - 2 freq bunder (2) - 1 freq bunker' (2) - 1 freq bulker (2) - 1 freq bunkers (2) - 12 freq bunter (2) - 8 freq unker (2) - 4 freq burker (2) - 2 freq hunker (2) - 12 freq bankers (3) - 4 freq bender (3) - 5 freq beaker (3) - 7 freq bunkum (3) - 1 freq wanker (3) - 17 freq baunner (3) - 5 freq jinker (3) - 2 freq baker (3) - 26 freq canker (3) - 4 freq linker (3) - 1 freq tanker (3) - 4 freq conker (3) - 1 freq banter (3) - 43 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 |
BUNKER |
| Time to execute Levenshtein function - 0.186314 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.351542 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.028053 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.037683 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.000869 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. |