Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bidixm (0) - 1 freq eidiom (2) - 2 freq biding (2) - 9 freq bidin' (2) - 3 freq bidit (2) - 30 freq idiom (2) - 9 freq bidie (2) - 3 freq bidin (2) - 201 freq didix (2) - 1 freq bides (3) - 230 freq bides- (3) - 1 freq bim (3) - 2 freq widid (3) - 2 freq tidied (3) - 7 freq bizzom (3) - 2 freq medium (3) - 71 freq hidie (3) - 1 freq boddam (3) - 23 freq bidding (3) - 4 freq biried (3) - 3 freq hidins (3) - 1 freq bigsam (3) - 1 freq boddim (3) - 31 freq biddy (3) - 12 freq idioms (3) - 8 freq |
bidixm (0) - 1 freq bdfm (4) - 17 freq boddim (4) - 31 freq boddam (4) - 23 freq boddum (4) - 1 freq boddem (4) - 1 freq boddom (4) - 39 freq bedlam (4) - 6 freq buddom (4) - 5 freq buddum (4) - 3 freq biding (4) - 9 freq bidin (4) - 201 freq bidie (4) - 3 freq eidiom (4) - 2 freq idiom (4) - 9 freq didix (4) - 1 freq bidin' (4) - 3 freq bidit (4) - 30 freq bedien (5) - 1 freq bodice (5) - 1 freq biddie (5) - 1 freq buidin (5) - 1 freq bid (5) - 77 freq baim (5) - 1 freq brim (5) - 17 freq |
SoundEx code - B325 botswana - 9 freq botswana's - 1 freq budgin - 3 freq beautician - 8 freq bedchaumers - 3 freq bedchaumer - 5 freq bewitchin - 1 freq bed-chaumer - 1 freq buddhism - 7 freq beauticians - 1 freq beautician's - 1 freq bits-on-the-side - 1 freq bodie-kyn - 1 freq betoken - 1 freq bitchin - 2 freq botswanan - 1 freq baudkin - 1 freq betokened - 1 freq body-snatchers - 2 freq body-snatcher - 1 freq bedeckin - 1 freq bitsun - 1 freq buits-on-the-street - 1 freq bitching - 1 freq bitsnbobs - 1 freq btywgnclxf - 1 freq batesmoira - 6 freq budsmam - 1 freq botcoin - 1 freq bidixm - 1 freq |
MetaPhone code - BTKSM bidixm - 1 freq |
BIDIXM |
Time to execute Levenshtein function - 0.474005 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.728526 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.078600 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.094442 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.001195 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. |