Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
besides (0) - 35 freq resides (1) - 1 freq beside (1) - 63 freq bisides (1) - 1 freq bides (2) - 228 freq bedside (2) - 20 freq besties (2) - 1 freq betimes (2) - 16 freq bestrides (2) - 1 freq resiles (2) - 1 freq a-sides (2) - 1 freq €œbesides (2) - 1 freq benside (2) - 1 freq €˜besides (2) - 1 freq belies (2) - 1 freq desires (2) - 10 freq insides (2) - 15 freq decides (2) - 27 freq 'sides (2) - 1 freq desydes (2) - 1 freq bedes (2) - 1 freq baeside (2) - 1 freq betide (2) - 4 freq asides (2) - 8 freq eeside (2) - 1 freq |
besides (0) - 35 freq bisides (1) - 1 freq resides (2) - 1 freq besyds (2) - 2 freq beside (2) - 63 freq baeside (3) - 1 freq bedes (3) - 1 freq 'sides (3) - 1 freq asides (3) - 8 freq desydes (3) - 1 freq beids (3) - 1 freq bosies (3) - 18 freq insides (3) - 15 freq upsides (3) - 5 freq brides (3) - 2 freq sides (3) - 155 freq beisines (3) - 5 freq a-sides (3) - 1 freq besties (3) - 1 freq bides (3) - 228 freq beists (4) - 1 freq beasties (4) - 51 freq basses (4) - 2 freq bashes (4) - 1 freq seids (4) - 1 freq |
SoundEx code - B232 beasts - 144 freq baskets - 8 freq bissett's - 1 freq buckets - 25 freq besides - 35 freq biscuits - 41 freq 'backstage - 1 freq buchts - 6 freq busts - 2 freq beastie's - 3 freq beasties - 51 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 beast's - 7 freq baists - 22 freq best-sellin - 1 freq bestkennt - 1 freq best-kennt - 1 freq backstage - 5 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 beists - 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 - 35 freq busts - 2 freq beastie's - 3 freq beasties - 51 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 beast's - 7 freq baists - 22 freq boasts - 3 freq bastes - 4 freq bust's - 1 freq biests - 1 freq beists - 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 |
BESIDES |
Time to execute Levenshtein function - 0.189138 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.374509 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.027337 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.037264 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.000878 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. |