| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-empty (0) - 1 freq half-empty (1) - 1 freq hauf-mete (3) - 1 freq hauf-mad (4) - 1 freq hauf-mirk (4) - 1 freq haufwey (4) - 14 freq hauf-etten (4) - 2 freq hauf-hopin (4) - 2 freq haufpenny (4) - 1 freq hauf-dernt (4) - 1 freq hauf-wits (4) - 1 freq noo-empty (4) - 1 freq hauf-pint (4) - 1 freq hauf-feart (4) - 2 freq half-echt (4) - 1 freq hauf-ersed (4) - 1 freq hauf-past (4) - 7 freq hauf-day (4) - 1 freq hauf-way (4) - 1 freq hauf-lit (4) - 4 freq hauf-muin (4) - 1 freq hauf-apen (4) - 2 freq hauf-wey (4) - 4 freq hauf-mast (4) - 3 freq hauf-threy (4) - 1 freq |
hauf-empty (0) - 1 freq half-empty (2) - 1 freq hauf-mete (4) - 1 freq hauf-mast (5) - 3 freq hauf-lit (6) - 4 freq hauf-feart (6) - 2 freq hauf-past (6) - 7 freq hauf-muin (6) - 1 freq hauf-daft (6) - 1 freq hauf-shut (6) - 2 freq humpty (6) - 7 freq hauf-apen (6) - 2 freq hauf-pint (6) - 1 freq noo-empty (6) - 1 freq hauf-hopin (6) - 2 freq hauf-mirk (6) - 1 freq hauf-mad (6) - 1 freq hauf-meisur (7) - 1 freq hauf-tuimt (7) - 1 freq hauf-loup (7) - 1 freq hempt (7) - 1 freq hauf-likit (7) - 1 freq hauf-smilet (7) - 1 freq hauf-spent (7) - 1 freq hauf-happit (7) - 2 freq |
SoundEx code - H151 hobnobbin - 2 freq hauf-empty - 1 freq hap-nap - 1 freq hobnob - 2 freq havenport - 1 freq hafnvagr - 1 freq |
MetaPhone code - HFMPT hauf-empty - 1 freq |
HAUF-EMPTY |
| Time to execute Levenshtein function - 0.289727 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.700089 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.028957 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.084192 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.000996 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. |