| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haufdwam (0) - 1 freq hauf-way (2) - 1 freq haufway (2) - 3 freq halfdan (3) - 5 freq hauf-day (3) - 1 freq hauf-sax (3) - 1 freq haundbag (3) - 4 freq hauf-mad (3) - 1 freq haudan (3) - 4 freq haufwey (3) - 14 freq hauf-won (3) - 1 freq hauf-wey (3) - 4 freq hauf-wye (3) - 2 freq halfway (3) - 7 freq haufwit (3) - 2 freq hauf-wits (4) - 1 freq baudran (4) - 2 freq hauflin (4) - 14 freq haundel (4) - 1 freq haudin (4) - 380 freq hauflie (4) - 1 freq haundower (4) - 1 freq halfa (4) - 2 freq hauddins (4) - 1 freq haedna (4) - 49 freq |
haufdwam (0) - 1 freq hauf-way (4) - 1 freq haufway (4) - 3 freq hauf-wey (5) - 4 freq hauf-wye (5) - 2 freq haufwey (5) - 14 freq haufwit (5) - 2 freq hauf-won (5) - 1 freq hauf-tume (6) - 1 freq dwam (6) - 102 freq handw (6) - 1 freq haufwyeg (6) - 1 freq haufed (6) - 2 freq hauf-tuim (6) - 1 freq hauf-wyes (6) - 1 freq handsum (6) - 1 freq hauf-time (6) - 1 freq humdrum (6) - 3 freq hauf-aware (6) - 1 freq haufwyes (6) - 2 freq haufweys (6) - 1 freq haundsome (6) - 1 freq haundower (6) - 1 freq hauf-mad (6) - 1 freq hauf-sax (6) - 1 freq |
SoundEx code - H135 hauf-hidden - 3 freq haufdwam - 1 freq hauf-tuimt - 1 freq hauf-tuim - 1 freq heftin - 41 freq haufdementit - 1 freq hauf-etten - 2 freq heftins - 1 freq hauf-tume - 1 freq hfetime - 1 freq hauf-time - 1 freq hvehdn - 1 freq hobbitoncentral - 3 freq |
MetaPhone code - HFTWM haufdwam - 1 freq |
HAUFDWAM |
| Time to execute Levenshtein function - 0.286834 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.448120 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.032066 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.038194 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.000871 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. |