| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hasslin (0) - 1 freq easslin (1) - 1 freq basslin (1) - 1 freq hashin (2) - 2 freq hanselin (2) - 1 freq passin (2) - 156 freq hissin (2) - 10 freq dassin (2) - 23 freq taislin (2) - 3 freq hailin (2) - 7 freq haalin (2) - 9 freq hussain (2) - 2 freq hannlin (2) - 26 freq wastlin (2) - 1 freq eastlin (2) - 2 freq fisslin (2) - 1 freq rassling (2) - 2 freq hausin (2) - 2 freq hassle (2) - 24 freq halin (2) - 1 freq harlin (2) - 3 freq hauflin (2) - 14 freq hagglin (2) - 1 freq hushlin (2) - 1 freq wrasslin (2) - 7 freq |
hasslin (0) - 1 freq easslin (2) - 1 freq basslin (2) - 1 freq hussain (3) - 2 freq hushlin (3) - 1 freq whusslin (3) - 1 freq hussein (3) - 1 freq hirslin (3) - 2 freq hustlin (3) - 1 freq fisslin (3) - 1 freq hassle (3) - 24 freq hanselin (3) - 1 freq hassan (3) - 1 freq hissin (3) - 10 freq fusslin (3) - 8 freq haiglin (4) - 3 freq warslin (4) - 17 freq handlin (4) - 1 freq haunlin (4) - 5 freq hessian (4) - 2 freq hissan (4) - 1 freq whussilin (4) - 1 freq rosslyn (4) - 2 freq hissen (4) - 1 freq fusslen (4) - 1 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 - HSLN hasslin - 1 freq |
HASSLIN |
| Time to execute Levenshtein function - 0.199694 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.366286 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.028302 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.043806 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.000903 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. |