Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
baests (0) - 13 freq baists (1) - 22 freq baest (1) - 27 freq baess (1) - 3 freq biests (1) - 1 freq taests (1) - 1 freq bests (1) - 2 freq baets (1) - 6 freq taesets (2) - 1 freq gests (2) - 2 freq kests (2) - 2 freq laists (2) - 1 freq bets (2) - 8 freq waists (2) - 3 freq breists (2) - 31 freq vests (2) - 4 freq bastes (2) - 4 freq lests (2) - 3 freq heests (2) - 2 freq blists (2) - 2 freq beats (2) - 34 freq baist's (2) - 4 freq guests (2) - 47 freq caess (2) - 3 freq gaets (2) - 4 freq |
baests (0) - 13 freq bests (1) - 2 freq biests (1) - 1 freq baists (1) - 22 freq beists (2) - 2 freq bastes (2) - 4 freq busts (2) - 2 freq baesties (2) - 1 freq boasts (2) - 3 freq beasts (2) - 144 freq buists (2) - 1 freq baess (2) - 3 freq baest (2) - 27 freq taests (2) - 1 freq baets (2) - 6 freq boosts (2) - 1 freq besta (3) - 2 freq beastis (3) - 1 freq best (3) - 1613 freq baits (3) - 3 freq brusts (3) - 2 freq beets (3) - 49 freq bauss (3) - 1 freq baestie (3) - 1 freq besty (3) - 2 freq |
SoundEx code - B232 beasts - 144 freq baskets - 8 freq bissett's - 1 freq buckets - 25 freq besides - 36 freq biscuits - 42 freq 'backstage - 1 freq buchts - 7 freq busts - 2 freq beastie's - 3 freq beasties - 52 freq baist's - 4 freq bisides - 1 freq 'beasts - 5 freq bests - 2 freq baests - 13 freq begets - 4 freq beastis - 1 freq baisties - 3 freq beest's - 1 freq basket's - 1 freq bestows - 1 freq backstage - 8 freq beists - 2 freq beast's - 7 freq baists - 22 freq best-sellin - 1 freq bestkennt - 1 freq best-kennt - 1 freq bestest - 5 freq boasts - 3 freq beckwith's - 2 freq bastes - 4 freq bust's - 1 freq bucket's - 1 freq best-kent - 6 freq bukkits - 1 freq biests - 1 freq baesties - 1 freq best-seller - 2 freq bestseller - 1 freq bouchts - 1 freq boosts - 1 freq 'biscuits' - 1 freq besyds - 2 freq buists - 1 freq bukkets - 1 freq best-keepit - 1 freq bouquets - 1 freq backsides - 2 freq €œbesides - 1 freq €˜besides - 1 freq basket-swords - 1 freq bigots - 4 freq bbcdouglasf - 1 freq baists' - 1 freq bbcthesocial - 10 freq bbcscotcomms - 1 freq besties - 1 freq bizquits - 1 freq bustage - 1 freq bgstxyfwtn - 1 freq bigotsureejits - 1 freq biscuits' - 1 freq bfkthsjgf - 1 freq bycatch - 1 freq bpqtg - 1 freq bbcsouthscot - 8 freq bzggedyk - 1 freq bkotg - 1 freq bbceducation - 1 freq bestcanton - 1 freq bbckitchencafe - 2 freq bctgb - 1 freq biscuitsgod - 1 freq |
MetaPhone code - BSTS beasts - 144 freq bissett's - 1 freq besides - 36 freq busts - 2 freq beastie's - 3 freq beasties - 52 freq baist's - 4 freq bisides - 1 freq 'beasts - 5 freq bests - 2 freq baests - 13 freq beastis - 1 freq baisties - 3 freq beest's - 1 freq bestows - 1 freq beists - 2 freq beast's - 7 freq baists - 22 freq boasts - 3 freq bastes - 4 freq bust's - 1 freq biests - 1 freq baesties - 1 freq boosts - 1 freq besyds - 2 freq buists - 1 freq €œbesides - 1 freq €˜besides - 1 freq baists' - 1 freq besties - 1 freq |
BAESTS |
Time to execute Levenshtein function - 0.277711 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.399790 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.027998 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.038728 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.000929 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. |