Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bluetooth (0) - 2 freq blaetorch (3) - 1 freq bluecoat (3) - 1 freq blurtet (4) - 3 freq bluest (4) - 1 freq luk-oot (4) - 1 freq tooth (4) - 21 freq booth (4) - 10 freq baadmooth (4) - 1 freq gluepot (4) - 1 freq bale-oot (4) - 1 freq bluitert (4) - 3 freq blakoot (4) - 1 freq bluto (4) - 1 freq blustert (4) - 2 freq blue-litt (4) - 1 freq eyemooth (4) - 1 freq clooth (4) - 1 freq flee-oots (4) - 1 freq blackoot (4) - 2 freq bluebottle (4) - 8 freq burntoot (4) - 1 freq begouth (4) - 2 freq begoot (4) - 2 freq blurtit (4) - 2 freq |
bluetooth (0) - 2 freq blaetorch (5) - 1 freq bluecoat (5) - 1 freq blawoot (6) - 1 freq blotto (6) - 1 freq bisooth (6) - 1 freq blurtit (6) - 2 freq begouth (6) - 2 freq bultit (6) - 1 freq benorth (6) - 2 freq blatts (6) - 5 freq blotts (6) - 1 freq blottit (6) - 1 freq blyth (6) - 16 freq bleatit (6) - 2 freq bluebottle (6) - 8 freq bloatit (6) - 3 freq blatt (6) - 2 freq tooth (6) - 21 freq blotch (6) - 5 freq blakoot (6) - 1 freq bluitert (6) - 3 freq bluest (6) - 1 freq bale-oot (6) - 1 freq bluto (6) - 1 freq |
SoundEx code - B433 buildit - 1 freq bieldit - 5 freq bielded - 3 freq belted - 14 freq beltit - 14 freq bleatit - 2 freq blaudit - 2 freq bultit - 1 freq billeted - 1 freq bluidied - 2 freq bolted - 19 freq blid-wat - 1 freq blytheheid - 1 freq bull-heidit - 2 freq baldy-heided - 1 freq bloatit - 3 freq blotted - 5 freq boltit - 4 freq bolt-haedit - 1 freq bloated - 1 freq bluidwytin-fain - 1 freq belated - 6 freq bauld-heidit - 1 freq blottit - 1 freq bald-heided - 1 freq beildit - 4 freq bladdit - 4 freq bauldy-heid - 1 freq belatedly - 1 freq bloodit - 1 freq boltet - 1 freq bltidlink - 1 freq boalted - 1 freq bleated - 1 freq bloodied - 1 freq bluetooth - 2 freq beleted - 1 freq 'belated' - 1 freq |
MetaPhone code - BLT0 bluetooth - 2 freq |
BLUETOOTH |
Time to execute Levenshtein function - 0.206589 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.381884 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.027078 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.036872 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.000852 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. |