| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| byfe (0) - 1 freq yfe (1) - 1 freq byre (1) - 111 freq lyfe (1) - 44 freq fyfe (1) - 14 freq byf (1) - 1 freq bye (1) - 115 freq byue (1) - 2 freq by-e (1) - 2 freq byne (1) - 1 freq byke (1) - 8 freq byte (1) - 1 freq byde (1) - 62 freq byle (1) - 16 freq wyfe (1) - 19 freq biae (2) - 1 freq fyve (2) - 8 freq byeee (2) - 1 freq bace (2) - 1 freq hyte (2) - 3 freq bfk (2) - 1 freq baff (2) - 3 freq bylie (2) - 1 freq 'yae (2) - 2 freq byel (2) - 1 freq |
byfe (0) - 1 freq byf (1) - 1 freq wyfe (2) - 19 freq byle (2) - 16 freq byte (2) - 1 freq baf (2) - 1 freq bfu (2) - 1 freq bf (2) - 6 freq befa (2) - 2 freq byke (2) - 8 freq byde (2) - 62 freq lyfe (2) - 44 freq byre (2) - 111 freq yfe (2) - 1 freq byne (2) - 1 freq fyfe (2) - 14 freq by-e (2) - 2 freq bye (2) - 115 freq byue (2) - 2 freq beefie (3) - 1 freq baif (3) - 4 freq lufe (3) - 1 freq bafhe (3) - 2 freq bie (3) - 15 freq byd (3) - 1 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 - BF bowff - 1 freq bevie - 2 freq boof - 3 freq boeuf - 1 freq beef - 83 freq bowf - 9 freq befaw - 3 freq beefie - 1 freq bevvy - 20 freq befa - 2 freq baffy - 3 freq befaa - 6 freq baff - 3 freq byfe - 1 freq baffie - 62 freq buff - 15 freq beef' - 1 freq bewvy - 2 freq baffe - 2 freq bevy - 5 freq bauf - 1 freq bevvie - 2 freq bouff - 1 freq bogha' - 1 freq beif - 2 freq beve - 1 freq baef - 6 freq bff - 1 freq bf - 6 freq bv - 2 freq biffy - 1 freq bev - 1 freq bbfa - 1 freq baf - 1 freq hbv - 1 freq biffo - 2 freq bfu - 1 freq baif - 4 freq bwv - 1 freq befio - 1 freq byf - 1 freq bufw - 1 freq bov - 1 freq bovvy - 2 freq |
BYFE |
| Time to execute Levenshtein function - 0.224215 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.392715 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.028524 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.038345 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.000904 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. |