| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bennachie (0) - 43 freq benachie (1) - 2 freq donnachie (2) - 1 freq 'sennachie' (3) - 2 freq connachin (3) - 1 freq beachit (3) - 6 freq benche (3) - 1 freq behoochie (3) - 1 freq bourachie (3) - 1 freq beachin (3) - 1 freq boorachie (3) - 4 freq vennacher (3) - 2 freq shenachie (3) - 3 freq kennedie (4) - 1 freq pennie (4) - 6 freq hennie (4) - 6 freq beanie (4) - 1 freq binnae (4) - 3 freq blackie (4) - 21 freq booncie (4) - 1 freq beinlie (4) - 1 freq menacin (4) - 3 freq snackie (4) - 1 freq barnacle (4) - 1 freq blanche (4) - 14 freq |
bennachie (0) - 43 freq benachie (2) - 2 freq donnachie (3) - 1 freq benche (4) - 1 freq shenachie (5) - 3 freq pinnochio (5) - 1 freq bench (5) - 54 freq binnack (5) - 2 freq connach (5) - 9 freq vennacher (5) - 2 freq blanche (5) - 14 freq connachin (5) - 1 freq boorachie (5) - 4 freq behoochie (5) - 1 freq bourachie (5) - 1 freq bannie (6) - 1 freq sennicht (6) - 10 freq connachs (6) - 1 freq bunchin (6) - 1 freq bourrachie (6) - 1 freq bennite (6) - 1 freq bahoochie (6) - 6 freq pinnacle (6) - 1 freq bannock (6) - 18 freq beannie (6) - 26 freq |
SoundEx code - B520 bank - 186 freq banes - 202 freq bens - 43 freq banks - 130 freq bins - 32 freq bing' - 2 freq bink - 26 freq bannocks - 42 freq bannock - 18 freq bang - 97 freq bunch - 105 freq bennachie - 43 freq binch - 6 freq bank' - 2 freq bing - 38 freq banns - 3 freq being - 296 freq beans - 64 freq bones - 61 freq bench - 54 freq bungs - 1 freq banksia - 1 freq buns - 22 freq boonce - 61 freq bingo - 38 freq banshee - 15 freq beens - 35 freq baunk - 30 freq bunk - 28 freq bings - 16 freq bounce - 23 freq bangs - 13 freq bams - 19 freq baying - 1 freq baunks - 6 freq beams - 8 freq banjo - 14 freq ben-i-hoose - 1 freq buying - 13 freq bum's - 2 freq booms - 3 freq binks - 7 freq bonny's - 1 freq binns - 2 freq bonshaw - 1 freq bynes - 1 freq bouncy - 7 freq boeing - 1 freq beins - 14 freq ben's - 1 freq bmc - 7 freq been's - 1 freq binkee - 1 freq boonies - 1 freq bunnies - 4 freq bans - 35 freq banzai - 1 freq bahamas - 2 freq bams' - 1 freq ban's - 2 freq baimns - 1 freq bannacks - 2 freq bonus - 21 freq bank- - 1 freq bunks - 4 freq bonnie's - 6 freq benche - 1 freq buncha - 2 freq bane's - 1 freq banes' - 2 freq boneys' - 1 freq boyne's - 1 freq bawns - 4 freq booncie - 1 freq ban'k - 1 freq bung - 2 freq buoyancy - 2 freq baims - 2 freq boannie-wyes - 3 freq bunchy - 1 freq buncy - 1 freq binnack - 2 freq binnacks - 1 freq baim's - 1 freq bonxie - 8 freq bums - 8 freq baank - 1 freq bonhoga - 1 freq booncy - 11 freq 'booncy - 1 freq bonns - 2 freq benks - 2 freq 'boonce - 1 freq bouyancy - 1 freq binnock - 1 freq bannos - 1 freq bans' - 1 freq bannock's - 1 freq bank-e - 1 freq bo'ness - 3 freq 'bannock' - 2 freq bonk - 2 freq bouns - 1 freq biomass - 2 freq boyng - 1 freq banis - 1 freq 'banes- - 1 freq bing's - 1 freq bonsai - 1 freq benk - 1 freq be-ins - 2 freq bankie - 2 freq bianco - 3 freq benachie - 2 freq benjy - 8 freq bauns - 4 freq bng - 1 freq beings - 3 freq bmg - 1 freq bungee - 1 freq €˜bans - 1 freq binge - 4 freq bonhoaga - 1 freq baens - 3 freq beenge - 1 freq binkie - 1 freq bmx - 1 freq bmxs - 1 freq €œbingo - 1 freq boones - 1 freq €œbang - 1 freq beange - 1 freq bines - 1 freq bynack - 1 freq beyonce - 1 freq bong - 3 freq ‘bunksyÂ’ - 1 freq bunksy - 1 freq bonce - 1 freq boneys - 1 freq bowing - 1 freq baines - 1 freq bunc - 1 freq bungy - 1 freq bun's - 1 freq buenos - 1 freq beyoncé’s - 2 freq bangu - 1 freq bnqo - 1 freq bmjj - 1 freq bfumx - 1 freq bmq - 1 freq 'being - 1 freq bbmjzg - 1 freq benosey - 1 freq boness - 3 freq |
MetaPhone code - BNX bunch - 105 freq bennachie - 43 freq binch - 6 freq bench - 54 freq banshee - 15 freq bonshaw - 1 freq benche - 1 freq buncha - 2 freq bunchy - 1 freq benachie - 2 freq |
BENNACHIE |
| Time to execute Levenshtein function - 0.316574 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.433990 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.029729 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.037062 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.000841 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. |