Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bowan (0) - 1 freq bowin (1) - 8 freq rowan (1) - 18 freq howan (1) - 1 freq gowan (1) - 16 freq boxan (1) - 1 freq bowen (1) - 1 freq cowan (1) - 7 freq blowan (1) - 5 freq lowan (1) - 6 freq boran (1) - 2 freq bowman (1) - 4 freq lowin (2) - 31 freq blaan (2) - 10 freq booman (2) - 2 freq 'oan (2) - 3 freq losan (2) - 2 freq so-an (2) - 2 freq mown (2) - 2 freq slowan (2) - 1 freq bitan (2) - 1 freq boag (2) - 10 freq bidan (2) - 9 freq bakan (2) - 1 freq o-an (2) - 1 freq |
bowan (0) - 1 freq bowen (1) - 1 freq bowin (1) - 8 freq blowan (2) - 5 freq bowman (2) - 4 freq cowan (2) - 7 freq boran (2) - 2 freq lowan (2) - 6 freq rowan (2) - 18 freq boxan (2) - 1 freq howan (2) - 1 freq gowan (2) - 16 freq botany (3) - 3 freq lown (3) - 58 freq bean (3) - 41 freq busan (3) - 1 freq bozen (3) - 1 freq born (3) - 324 freq wan (3) - 2334 freq powen (3) - 8 freq mowin (3) - 2 freq owain (3) - 1 freq boxin (3) - 13 freq bon (3) - 13 freq bran (3) - 11 freq |
SoundEx code - B500 bein - 1744 freq been - 5087 freq bonnie - 805 freq behin - 41 freq bin - 954 freq ben - 605 freq be-in - 29 freq baun - 18 freq bonny - 496 freq bowin - 8 freq bone - 45 freq boon - 7 freq beeame - 1 freq bane - 81 freq binna - 29 freq bien - 19 freq bony - 6 freq beam - 18 freq bammy - 2 freq 'bonnie - 2 freq bunn - 1 freq beena - 1 freq bum - 43 freq bouin - 5 freq 'bam - 1 freq 'bin - 1 freq bein' - 59 freq boney - 9 freq buin - 12 freq booin - 17 freq baain - 2 freq bmw - 4 freq buyin - 84 freq bine - 11 freq bainie - 1 freq bun - 59 freq banie - 1 freq bain - 77 freq ban - 48 freq bayan - 4 freq baney - 12 freq bany - 1 freq bean - 41 freq buyin' - 5 freq baim - 1 freq beem - 5 freq beein - 14 freq buyen - 1 freq boom - 30 freq bohun - 2 freq bam - 38 freq beanie - 1 freq bim - 2 freq bunny - 4 freq bono - 3 freq 'bein - 2 freq bonie - 13 freq binnae - 3 freq ban' - 26 freq boney' - 1 freq 'bonny' - 1 freq baein - 20 freq baehin - 11 freq bon - 13 freq bee-en - 2 freq behun - 1 freq been' - 1 freq bonme - 1 freq behin' - 2 freq bann - 9 freq baen - 8 freq bo'm - 1 freq be'n - 2 freq bayin - 2 freq baimie - 1 freq boannie - 59 freq boy-an - 1 freq 'bonnie' - 2 freq bön - 23 freq bom - 3 freq buyan - 3 freq 'ben' - 1 freq bum' - 1 freq benny - 2 freq bene - 106 freq be'in - 3 freq boanny - 4 freq buena - 1 freq bame - 2 freq beano - 5 freq boun' - 1 freq bn - 7 freq bohemia - 2 freq byn - 2 freq boun - 10 freq boanie - 2 freq boany - 1 freq bena - 1 freq baum - 2 freq beyon - 1 freq be-an - 17 freq 'bonny - 2 freq bowan - 1 freq bane- - 1 freq beenie - 5 freq bøn - 18 freq beinn - 2 freq beween - 1 freq byne - 1 freq €˜binna - 1 freq bowen - 1 freq beame - 1 freq €œbeen - 1 freq beean - 1 freq €˜bene - 1 freq boonie - 2 freq €˜bonnie - 2 freq €œbonnie - 1 freq bean' - 1 freq binne - 1 freq beannie - 26 freq bannie - 1 freq boyne - 4 freq €œbein - 2 freq buon - 1 freq bai-yun - 8 freq beina - 1 freq baiyun - 1 freq 'boon - 1 freq benn - 1 freq bhain - 24 freq bem - 1 freq beeän - 1 freq bÂ’in - 3 freq bm - 5 freq bpn - 1 freq bone' - 1 freq bonn - 2 freq bmi - 1 freq beinÂ’ - 2 freq beenawa - 1 freq bfn - 1 freq bÂœn - 1 freq “bun - 1 freq bnw - 1 freq bunno - 1 freq |
MetaPhone code - BWN bowin - 8 freq bowan - 1 freq beween - 1 freq bowen - 1 freq |
BOWAN |
Time to execute Levenshtein function - 0.188256 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.350515 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.027800 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.037032 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.001351 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. |