Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
babbie (0) - 34 freq tabbie (1) - 1 freq babble (1) - 2 freq babbit (1) - 2 freq baabie (1) - 21 freq mabbie (1) - 1 freq babie (1) - 1 freq babbies (1) - 13 freq bobbie (1) - 15 freq rabbie (1) - 65 freq fabbie (1) - 2 freq cabbie (1) - 3 freq babbin (1) - 4 freq nabbie (1) - 7 freq habbie (1) - 9 freq gabbie (1) - 1 freq abbie (1) - 59 freq barbie (1) - 3 freq boabie (2) - 2 freq bafhie (2) - 2 freq boabbin (2) - 1 freq hibbie (2) - 2 freq sabbit (2) - 1 freq robbie (2) - 61 freq baimie (2) - 1 freq |
babbie (0) - 34 freq bobbie (1) - 15 freq babbin (2) - 4 freq cabbie (2) - 3 freq nabbie (2) - 7 freq gabbie (2) - 1 freq barbie (2) - 3 freq abbie (2) - 59 freq fabbie (2) - 2 freq babby (2) - 25 freq habbie (2) - 9 freq babbit (2) - 2 freq rabbie (2) - 65 freq tabbie (2) - 1 freq baabie (2) - 21 freq babble (2) - 2 freq babbies (2) - 13 freq mabbie (2) - 1 freq babie (2) - 1 freq bubble (3) - 37 freq yabble (3) - 1 freq mebbie (3) - 6 freq babbed (3) - 1 freq baobab (3) - 5 freq bawbee (3) - 23 freq |
SoundEx code - B100 bob - 214 freq bowff - 1 freq bobby - 45 freq boab - 53 freq baby - 121 freq babe - 11 freq babbie - 34 freq bevie - 2 freq boof - 3 freq boeuf - 1 freq beef - 83 freq bobbie - 15 freq bib - 8 freq babby - 25 freq bawbee - 23 freq babie - 1 freq bowf - 9 freq boabby - 23 freq befaw - 3 freq beefie - 1 freq bevvy - 20 freq befa - 2 freq baba - 2 freq baffy - 3 freq bye-bye - 1 freq behave - 38 freq befaa - 6 freq bappie - 1 freq bap - 16 freq baff - 3 freq bihaive - 1 freq byfe - 1 freq boaby - 6 freq beeeeeeeepp - 1 freq beep - 11 freq baayyybeeeeh - 1 freq 'beep' - 1 freq bab - 13 freq baffie - 62 freq beehive - 1 freq buff - 15 freq beef' - 1 freq behauf - 17 freq beeb' - 1 freq bewvy - 2 freq baabie - 21 freq bubba - 1 freq bafhe - 2 freq baffe - 2 freq bafhie - 2 freq boob - 5 freq bibby - 3 freq bevy - 5 freq bauf - 1 freq baby' - 1 freq booby - 9 freq bobo - 9 freq behaiv - 1 freq baby-e - 1 freq bebe - 3 freq bevvie - 2 freq bouff - 1 freq behouf - 1 freq 'bib - 1 freq beif - 2 freq bappy - 27 freq behufe - 1 freq 'babe' - 1 freq beve - 1 freq beb - 1 freq bawbee- - 2 freq bapu - 14 freq €œbapu - 1 freq baw-bee - 1 freq baef - 6 freq boabie - 2 freq boba - 2 freq biffy - 1 freq bev - 1 freq baf - 1 freq bebo - 1 freq bhheypya - 1 freq bhp - 1 freq biffo - 2 freq beeb - 1 freq baif - 4 freq bpub - 1 freq bwv - 1 freq befio - 1 freq byf - 1 freq bufw - 1 freq bov - 1 freq bovvy - 2 freq |
MetaPhone code - BB bob - 214 freq bobby - 45 freq boab - 53 freq baby - 121 freq babe - 11 freq babbie - 34 freq bobbie - 15 freq bib - 8 freq babby - 25 freq bawbee - 23 freq babie - 1 freq boabby - 23 freq baba - 2 freq boaby - 6 freq baayyybeeeeh - 1 freq bab - 13 freq beeb' - 1 freq baabie - 21 freq bubba - 1 freq boob - 5 freq bibby - 3 freq baby' - 1 freq booby - 9 freq bobo - 9 freq baby-e - 1 freq bebe - 3 freq 'bib - 1 freq 'babe' - 1 freq beb - 1 freq bawbee- - 2 freq baw-bee - 1 freq boabie - 2 freq boba - 2 freq bebo - 1 freq beeb - 1 freq |
BABBIE |
Time to execute Levenshtein function - 0.228909 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.370146 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.027546 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.036992 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.000967 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. |