| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bucklin (0) - 7 freq hucklin (1) - 2 freq buckin (1) - 3 freq bucklit (1) - 1 freq sucklin (1) - 1 freq hurklin (2) - 1 freq mucklie (2) - 1 freq ruckling (2) - 1 freq cacklin (2) - 2 freq racklin (2) - 3 freq bukin (2) - 1 freq pucklie (2) - 35 freq ticklin (2) - 6 freq knucklin (2) - 1 freq bukksin (2) - 1 freq buckled (2) - 7 freq picklin (2) - 2 freq bulin (2) - 1 freq bucketin (2) - 2 freq buckle (2) - 12 freq fuckin (2) - 1032 freq suckin (2) - 6 freq kecklin (2) - 11 freq chucklin (2) - 3 freq muckin (2) - 5 freq |
bucklin (0) - 7 freq bucklit (2) - 1 freq sucklin (2) - 1 freq hucklin (2) - 2 freq buckin (2) - 3 freq tacklin (3) - 4 freq buckled (3) - 7 freq bucketin (3) - 2 freq picklin (3) - 2 freq bauchlin (3) - 1 freq kecklin (3) - 11 freq backlit (3) - 1 freq backlins (3) - 18 freq buckle (3) - 12 freq hecklin (3) - 1 freq buckles (3) - 2 freq bucklet (3) - 1 freq bucklt (3) - 2 freq tecklin (3) - 1 freq cacklin (3) - 2 freq ticklin (3) - 6 freq backin (3) - 41 freq racklin (3) - 3 freq bummlin (4) - 2 freq butlin (4) - 2 freq |
SoundEx code - B245 beglaummer't - 1 freq backlan's - 1 freq beglamourt - 1 freq backlins-comin - 2 freq bucklin - 7 freq becalmed - 2 freq beglamour - 3 freq beglamoured - 1 freq becalm - 2 freq beguilin - 1 freq beglamourin - 5 freq basslin - 1 freq backlins - 18 freq backlands - 1 freq baklins - 7 freq backleens - 1 freq bogilan - 1 freq backlauns - 1 freq back-lyin - 1 freq boglands - 1 freq €˜baseline - 1 freq bauchlin - 1 freq baseline - 2 freq bbclamacqshow - 1 freq bbcaileenclarke - 1 freq |
MetaPhone code - BKLN bucklin - 7 freq beguilin - 1 freq |
BUCKLIN |
| Time to execute Levenshtein function - 0.208549 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.354544 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.027659 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.036935 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.000917 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. |