| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hirlin (0) - 1 freq whirlin (1) - 5 freq hirslin (1) - 2 freq chirlin (1) - 1 freq mirlin (1) - 3 freq tirlin (1) - 13 freq dirlin (1) - 45 freq hidlin (1) - 1 freq hirdin (1) - 4 freq hirin (1) - 3 freq hurlin (1) - 21 freq birlin (1) - 156 freq hirplin (1) - 28 freq thirlin (1) - 7 freq harlin (1) - 3 freq pirlin (1) - 8 freq yirlins (2) - 1 freq kinlin (2) - 2 freq birrin (2) - 4 freq wilin (2) - 1 freq hurlie (2) - 1 freq whirling (2) - 3 freq birlins (2) - 1 freq healin (2) - 9 freq huirdin (2) - 1 freq |
hirlin (0) - 1 freq harlin (1) - 3 freq hurlin (1) - 21 freq hirplin (2) - 28 freq birlin (2) - 156 freq pirlin (2) - 8 freq hurlan (2) - 4 freq hairline (2) - 4 freq hirin (2) - 3 freq thirlin (2) - 7 freq chirlin (2) - 1 freq hirdin (2) - 4 freq whirlin (2) - 5 freq mirlin (2) - 3 freq hirslin (2) - 2 freq tirlin (2) - 13 freq dirlin (2) - 45 freq hidlin (2) - 1 freq gurlin (3) - 4 freq yorlin (3) - 12 freq whurlin (3) - 1 freq halin (3) - 1 freq hermin (3) - 2 freq hurin (3) - 1 freq haiglin (3) - 3 freq |
SoundEx code - H645 hurlin - 21 freq hairline - 4 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 - 21 freq hairline - 4 freq hirlin - 1 freq hurlan - 4 freq hair-line - 1 freq harlin - 3 freq |
HIRLIN |
| Time to execute Levenshtein function - 0.352001 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.417008 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.035852 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.044469 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.000949 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. |