| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haufwey-daicent (0) - 1 freq hauf-decent (5) - 1 freq haufdecent (6) - 1 freq hauf-angert (7) - 1 freq hauf-price (7) - 2 freq hauf-apen (7) - 2 freq hauf-daft (7) - 1 freq hauf-smilet (7) - 1 freq hauf-pint (7) - 1 freq hauf-dernt (7) - 1 freq hauf-licht (7) - 6 freq hauf-myndit (7) - 1 freq hauf-a-dizzen (7) - 6 freq haufa-dizzen (7) - 1 freq hauf-dizzen (7) - 1 freq hauf-spent (7) - 1 freq hauf-tuimt (8) - 1 freq hauf-gates (8) - 1 freq hauf-turnt (8) - 1 freq haufdementit (8) - 1 freq haund-wuiven (8) - 1 freq half-pint (8) - 1 freq haurdent (8) - 1 freq hauf-yin (8) - 10 freq haufwyes (8) - 2 freq |
haufwey-daicent (0) - 1 freq hauf-decent (6) - 1 freq haufdecent (8) - 1 freq hauf-dernt (9) - 1 freq hauf-pint (10) - 1 freq hauf-licht (10) - 6 freq hauf-spent (10) - 1 freq hauf-daft (10) - 1 freq haufa-dizzen (11) - 1 freq hauf-turnt (11) - 1 freq hauf-a-dizzen (11) - 6 freq hauf-dizzen (11) - 1 freq hauf-a-meenit (11) - 1 freq hauf-angert (11) - 1 freq hauf-myndit (11) - 1 freq hauf-apen (11) - 2 freq hauf-smilet (11) - 1 freq hauf-hidden (12) - 3 freq half-licht (12) - 1 freq humfy-backit (12) - 1 freq hauf-day (12) - 1 freq hauf-biggit (12) - 2 freq hauf-centurie (12) - 1 freq hauf-deid (12) - 8 freq hauden-doon (12) - 1 freq |
SoundEx code - H132 hauf-a-dizzen - 6 freq haufa-dizzen - 1 freq habits - 23 freq haffets - 6 freq hauf-wits - 1 freq haufdecent - 1 freq hauf-dizzen - 1 freq habit's - 1 freq hauf-decent - 1 freq hefts - 39 freq hypothecat - 1 freq hypothecated - 1 freq hauf-thoosand - 1 freq habités - 1 freq hypothesis - 1 freq haufwits - 2 freq haufwey-daicent - 1 freq habitus - 1 freq hpetycdbhp - 1 freq hbdxuh - 1 freq happydays - 6 freq |
MetaPhone code - HFWTSNT haufwey-daicent - 1 freq |
HAUFWEY-DAICENT |
| Time to execute Levenshtein function - 0.233816 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.395136 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.028602 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.039668 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.000886 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. |