| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hucklin (0) - 2 freq hecklin (1) - 1 freq bucklin (1) - 7 freq hurklin (1) - 1 freq sucklin (1) - 1 freq chucklin (1) - 3 freq muckin (2) - 5 freq uckin (2) - 1 freq cuckin (2) - 1 freq huckle (2) - 11 freq racklin (2) - 3 freq ticklin (2) - 6 freq hurtlin (2) - 9 freq pucklie (2) - 35 freq chuckin (2) - 17 freq tuckin (2) - 9 freq chuckling (2) - 1 freq hackin (2) - 7 freq humblin (2) - 1 freq huckled (2) - 12 freq hushlin (2) - 1 freq cacklin (2) - 2 freq huchin (2) - 1 freq bucklit (2) - 1 freq hurdlin (2) - 1 freq |
hucklin (0) - 2 freq hecklin (1) - 1 freq chucklin (2) - 3 freq sucklin (2) - 1 freq bucklin (2) - 7 freq hurklin (2) - 1 freq picklin (3) - 2 freq hackin (3) - 7 freq huckled (3) - 12 freq ehuckin (3) - 1 freq shucklan (3) - 1 freq huckles (3) - 1 freq cacklin (3) - 2 freq kecklin (3) - 11 freq tecklin (3) - 1 freq hockin (3) - 4 freq tacklin (3) - 4 freq huckle (3) - 11 freq racklin (3) - 3 freq chucklan (3) - 1 freq ticklin (3) - 6 freq ruckling (4) - 1 freq hunkin (4) - 1 freq runklin (4) - 1 freq hurlin (4) - 21 freq |
SoundEx code - H245 highlander - 7 freq highland - 31 freq hucklin - 2 freq hicland - 1 freq highlands - 12 freq highlander' - 1 freq highlanders - 17 freq hasslin - 1 freq hazelnits - 1 freq highlandman' - 1 freq hook-line - 1 freq haiglin - 3 freq hushlin - 1 freq highlandman - 1 freq highlans - 1 freq hagglin - 1 freq hazelnut - 1 freq highlandwriter - 8 freq highlandhistory - 1 freq highlandrampage - 1 freq hecklin - 1 freq haslington - 1 freq highlandermsp - 1 freq highlandlit - 1 freq haslam - 1 freq highlandchica - 1 freq |
MetaPhone code - HKLN hucklin - 2 freq hook-line - 1 freq haiglin - 3 freq hagglin - 1 freq hecklin - 1 freq |
HUCKLIN |
| Time to execute Levenshtein function - 0.198764 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.353275 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.028025 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.037431 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.000946 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. |