| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| btywgnclxf (0) - 1 freq tywan (6) - 1 freq bryanca (6) - 4 freq twenklin (6) - 4 freq brownlea (6) - 1 freq 'twenkle (6) - 1 freq t'wenkle (6) - 1 freq twenkle (6) - 5 freq wcjxf (6) - 1 freq gncwf (6) - 1 freq twinklt (6) - 1 freq bignold (6) - 1 freq twin'll (6) - 1 freq beyonce (6) - 1 freq twinkled (6) - 3 freq btglqkqf (6) - 1 freq twenkle- (6) - 1 freq twinklan (6) - 4 freq twinklin (6) - 15 freq bwlx (6) - 1 freq btmknxu (6) - 1 freq orygnale (6) - 1 freq twinkle- (6) - 2 freq sgywlx (6) - 1 freq towneley (6) - 1 freq |
btywgnclxf (0) - 1 freq bwlx (11) - 1 freq twinklan (11) - 4 freq btglqkqf (11) - 1 freq btmknxu (11) - 1 freq twenkle- (11) - 1 freq towneley (11) - 1 freq brownlee (11) - 1 freq twinkle (11) - 27 freq 'twinkle (11) - 2 freq twinkled (11) - 3 freq twinkle- (11) - 2 freq twinklin (11) - 15 freq twenkle (11) - 5 freq 'twenkle (11) - 1 freq twenklin (11) - 4 freq wcjxf (11) - 1 freq brownlea (11) - 1 freq bignold (11) - 1 freq twin'll (11) - 1 freq twinklt (11) - 1 freq gncwf (11) - 1 freq wubncxs (12) - 1 freq bowlfu (12) - 1 freq incalf (12) - 1 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 - BTKNKLKS |
BTYWGNCLXF |
| Time to execute Levenshtein function - 0.226092 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.393584 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.028349 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.041861 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.001137 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. |