| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benkis (0) - 1 freq benks (1) - 2 freq bekis (1) - 6 freq beaks (2) - 7 freq buskis (2) - 1 freq beskit (2) - 3 freq denis (2) - 11 freq bankins (2) - 2 freq beukit (2) - 3 freq blenkin (2) - 1 freq bekkin (2) - 1 freq tennis (2) - 23 freq beukin (2) - 1 freq bankin (2) - 19 freq blenks (2) - 1 freq bankie (2) - 2 freq benk (2) - 1 freq beikin (2) - 3 freq beak's (2) - 1 freq jenkins (2) - 4 freq bendin (2) - 14 freq beukie (2) - 7 freq blenkit (2) - 1 freq becks (2) - 8 freq beek's (2) - 3 freq |
benkis (0) - 1 freq benks (1) - 2 freq binks (2) - 7 freq bunks (2) - 4 freq bekis (2) - 6 freq banks (2) - 130 freq binkie (3) - 1 freq bents (3) - 11 freq ben's (3) - 1 freq binkin (3) - 1 freq bankit (3) - 1 freq bends (3) - 12 freq bentos (3) - 1 freq bens (3) - 43 freq banis (3) - 1 freq banksia (3) - 1 freq beuks (3) - 54 freq beiks (3) - 3 freq bunksy (3) - 1 freq becks (3) - 8 freq bonkin (3) - 1 freq bakis (3) - 1 freq bankie (3) - 2 freq benk (3) - 1 freq buskis (3) - 1 freq |
SoundEx code - B522 banshee's - 2 freq benshees - 2 freq bunches - 6 freq benches - 13 freq bounces - 4 freq banshees - 6 freq benkis - 1 freq banjos - 2 freq binges - 1 freq 'banshees' - 1 freq bingos - 1 freq boonces - 4 freq 'boonce's - 1 freq boonce's - 3 freq boneshaker - 1 freq bunghsie - 2 freq banghs - 1 freq bonxie's - 1 freq bangkok - 2 freq bianco's - 1 freq benjy's - 1 freq bonsais - 1 freq bonxies - 4 freq boom-cognate-boom-hum-end-o-game - 1 freq bnqyikqq - 1 freq |
MetaPhone code - BNKS banks - 130 freq bannocks - 42 freq bungs - 1 freq bings - 16 freq bangs - 13 freq baunks - 6 freq benkis - 1 freq binks - 7 freq bannacks - 2 freq bunks - 4 freq bingos - 1 freq binnacks - 1 freq bonxie - 8 freq benks - 2 freq bannock's - 1 freq bing's - 1 freq bianco's - 1 freq beings - 3 freq bunksy - 1 freq bunksy - 1 freq |
BENKIS |
| Time to execute Levenshtein function - 0.335971 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.551739 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.054296 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.044482 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.000923 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. |