| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harlin (0) - 3 freq harkin (1) - 5 freq harin (1) - 2 freq darlin (1) - 54 freq haulin (1) - 19 freq hirlin (1) - 1 freq harlit (1) - 1 freq hurlin (1) - 20 freq hailin (1) - 7 freq halin (1) - 1 freq harlie (1) - 6 freq carlin (1) - 6 freq haalin (1) - 9 freq hawkin (2) - 3 freq haein (2) - 658 freq hannlin (2) - 26 freq hearkin (2) - 1 freq hairpin (2) - 3 freq karling (2) - 1 freq warin (2) - 2 freq palin (2) - 4 freq handlin (2) - 1 freq sharein (2) - 1 freq carvin (2) - 6 freq hallan (2) - 1 freq |
harlin (0) - 3 freq hurlin (1) - 20 freq hirlin (1) - 1 freq carlin (2) - 6 freq hairline (2) - 3 freq hurlan (2) - 4 freq harlie (2) - 6 freq haalin (2) - 9 freq halin (2) - 1 freq harkin (2) - 5 freq harin (2) - 2 freq darlin (2) - 54 freq haulin (2) - 19 freq hailin (2) - 7 freq harlit (2) - 1 freq harley (3) - 7 freq heilin (3) - 1 freq hurdlin (3) - 1 freq hirdin (3) - 4 freq haulen (3) - 10 freq thirlin (3) - 7 freq hearin (3) - 174 freq charlen (3) - 1 freq chirlin (3) - 1 freq tarlan (3) - 4 freq |
SoundEx code - H645 hurlin - 20 freq hairline - 3 freq hirlin - 1 freq harlem - 1 freq hurlan - 4 freq harleen-clad - 1 freq hair-line - 1 freq harlin - 3 freq heirloom - 1 freq hurling - 2 freq |
MetaPhone code - HRLN hurlin - 20 freq hairline - 3 freq hirlin - 1 freq hurlan - 4 freq hair-line - 1 freq harlin - 3 freq |
HARLIN |
| Time to execute Levenshtein function - 0.234810 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.378811 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.030846 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.039302 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.000835 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. |