| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| babe (0) - 11 freq babie (1) - 1 freq bane (1) - 81 freq baba (1) - 2 freq bate (1) - 66 freq bare (1) - 171 freq bake (1) - 37 freq gabe (1) - 1 freq abe (1) - 3 freq bab (1) - 13 freq bebe (1) - 3 freq baby (1) - 117 freq bame (1) - 2 freq babel (1) - 7 freq babes (1) - 5 freq babs (1) - 2 freq bale (1) - 8 freq bace (1) - 1 freq base (1) - 39 freq bade (1) - 234 freq bae (1) - 855 freq ball (2) - 62 freq baef (2) - 6 freq gale (2) - 64 freq bair (2) - 1 freq |
babe (0) - 11 freq baby (1) - 117 freq bebe (1) - 3 freq bab (1) - 13 freq babie (1) - 1 freq baba (1) - 2 freq bba (2) - 1 freq boaby (2) - 5 freq bb (2) - 9 freq bebo (2) - 1 freq bib (2) - 8 freq ebbe (2) - 5 freq boab (2) - 53 freq bob (2) - 213 freq beb (2) - 1 freq bobo (2) - 9 freq boba (2) - 2 freq bae (2) - 855 freq baabie (2) - 21 freq boabie (2) - 2 freq bake (2) - 37 freq bace (2) - 1 freq bade (2) - 234 freq bale (2) - 8 freq bame (2) - 2 freq |
SoundEx code - B100 bob - 213 freq bowff - 1 freq bobby - 45 freq boab - 53 freq baby - 117 freq babe - 11 freq babbie - 34 freq bevie - 2 freq boof - 3 freq boeuf - 1 freq beef - 79 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 - 18 freq befa - 2 freq baba - 2 freq baffy - 3 freq bye-bye - 1 freq behave - 37 freq befaa - 6 freq bappie - 1 freq bap - 16 freq baff - 3 freq bihaive - 1 freq byfe - 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 boaby - 5 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 beep - 9 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 - 213 freq bobby - 45 freq boab - 53 freq baby - 117 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 bab - 13 freq beeb' - 1 freq baabie - 21 freq bubba - 1 freq boaby - 5 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 |
BABE |
| Time to execute Levenshtein function - 0.202347 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.401002 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.059248 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.075148 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.000856 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. |