| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauflie (0) - 1 freq hauflin (1) - 14 freq haurlie (1) - 4 freq sauflie (1) - 1 freq haulie (1) - 1 freq waullie (2) - 2 freq halie (2) - 83 freq harlie (2) - 6 freq haunlit (2) - 1 freq hamelie (2) - 2 freq haffie (2) - 1 freq hauf-lit (2) - 4 freq haunlin (2) - 5 freq hailie (2) - 10 freq hallie (2) - 1 freq haufling (2) - 1 freq haurdlie (2) - 9 freq haalie (2) - 1 freq haunle (2) - 26 freq haulin (2) - 19 freq sauftie (2) - 4 freq huilie (2) - 2 freq hurlie (2) - 1 freq halplie (2) - 1 freq halflin (2) - 14 freq |
hauflie (0) - 1 freq haulie (2) - 1 freq sauflie (2) - 1 freq haurlie (2) - 4 freq hauflin (2) - 14 freq haalie (3) - 1 freq hallie (3) - 1 freq haillie (3) - 8 freq hailie (3) - 10 freq hurlie (3) - 1 freq huilie (3) - 2 freq haunle (3) - 26 freq harlie (3) - 6 freq hamelie (3) - 2 freq haffie (3) - 1 freq halie (3) - 83 freq saufly (4) - 1 freq flie (4) - 9 freq hale (4) - 965 freq habile (4) - 6 freq haunil (4) - 1 freq halle (4) - 3 freq haufwey (4) - 14 freq humilie (4) - 1 freq heatlie (4) - 3 freq |
SoundEx code - H140 huffily - 3 freq happily - 40 freq hauflie - 1 freq 'hevylie - 1 freq hayvul - 1 freq heavily - 9 freq howpfully - 6 freq hoopful - 3 freq habile - 6 freq hovel - 4 freq 'hovel' - 1 freq habble - 2 freq happilie - 1 freq howpfullie - 1 freq hubble - 3 freq habbil - 1 freq hoopfully - 2 freq hvl - 2 freq |
MetaPhone code - HFL huffily - 3 freq highly - 17 freq hauflie - 1 freq 'hevylie - 1 freq hayvul - 1 freq heavily - 9 freq hovel - 4 freq 'hovel' - 1 freq €˜highly - 1 freq |
HAUFLIE |
| Time to execute Levenshtein function - 0.300303 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.503656 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.052346 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.037638 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.000861 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. |