Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
beanston (0) - 1 freq branson (2) - 25 freq beaton (2) - 35 freq easton (2) - 3 freq benson (2) - 1 freq canton (3) - 2 freq hanson (3) - 1 freq bastion (3) - 2 freq ten-ton (3) - 1 freq beacon (3) - 5 freq tension (3) - 32 freq pension (3) - 54 freq manson (3) - 14 freq langton (3) - 1 freq galston (3) - 2 freq beastie (3) - 38 freq winston (3) - 3 freq brandon (3) - 2 freq burnton (3) - 2 freq keaton (3) - 1 freq sanson (3) - 1 freq beatin (3) - 34 freq fanton (3) - 3 freq bentos (3) - 1 freq eaton (3) - 1 freq |
beanston (0) - 1 freq benson (3) - 1 freq blastin (4) - 11 freq biastin (4) - 2 freq bonnyton (4) - 18 freq boastin (4) - 3 freq boston (4) - 2 freq bntton (4) - 1 freq bastin (4) - 1 freq winston (4) - 3 freq bilston (4) - 14 freq joanstoon (4) - 1 freq bastion (4) - 2 freq easton (4) - 3 freq branson (4) - 25 freq beaton (4) - 35 freq €™easton (5) - 1 freq beastis (5) - 1 freq beast- (5) - 1 freq canton (5) - 2 freq johnston (5) - 19 freq 'winston (5) - 1 freq renton (5) - 4 freq hanson (5) - 1 freq benon (5) - 1 freq |
SoundEx code - B523 bonniest - 48 freq banjoed - 1 freq bamstick - 4 freq banquet - 7 freq benmaist - 3 freq banisht - 1 freq bounced - 12 freq bammiest - 1 freq bemused - 8 freq banged - 26 freq bainisht - 5 freq beenmaist - 1 freq banished - 3 freq bung't - 4 freq bunged - 7 freq be-nichtit - 1 freq bemuised - 1 freq bainished - 1 freq bangsters - 3 freq binkheid - 1 freq bing'd - 1 freq beanstalk - 3 freq banked - 2 freq banketin-buird - 1 freq bnghton - 1 freq bangster - 4 freq bangstry - 4 freq bannister - 2 freq bannisters - 3 freq banquets - 1 freq bengtsson - 1 freq boonced - 20 freq bangity-bang - 3 freq banister - 2 freq bane-stabbin - 1 freq banquet-ha - 1 freq bangstrie - 3 freq boanniest - 2 freq benzedrene - 2 freq benside - 1 freq b-meesed - 1 freq bankit - 1 freq benighted - 1 freq bunched - 1 freq benzodiazepine - 1 freq bangdag - 1 freq binged - 1 freq benched - 1 freq beingscots - 10 freq bonxied - 1 freq beanston - 1 freq |
MetaPhone code - BNSTN beanston - 1 freq |
BEANSTON |
Time to execute Levenshtein function - 0.369834 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.652784 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.065923 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.040114 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.000892 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. |