| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-chackit (0) - 1 freq hauf-naukit (3) - 2 freq half-thacket (3) - 1 freq hauf-happit (3) - 2 freq hauf-nyaakit (3) - 1 freq hauf-steikit (4) - 2 freq hauf-hertit (4) - 1 freq half-shapit (4) - 1 freq hauf-lachin (4) - 1 freq hauf-likit (4) - 1 freq hauf-chaaed (4) - 1 freq hauf-cock (4) - 1 freq hauf-hingit (4) - 1 freq hallierackit (5) - 5 freq hauf-masked (5) - 1 freq haillerackit (5) - 2 freq humfy-backit (5) - 1 freq hauf-thrie (5) - 1 freq hauf-mast (5) - 3 freq hauf-licht (5) - 6 freq chackit (5) - 1 freq hauf-souchin (5) - 1 freq han-pickit (5) - 1 freq aff-takkit (5) - 1 freq lang-shankit (5) - 2 freq |
hauf-chackit (0) - 1 freq half-thacket (5) - 1 freq hauf-naukit (6) - 2 freq hauf-nyaakit (6) - 1 freq hauf-cock (6) - 1 freq hauf-happit (6) - 2 freq hauf-steikit (7) - 2 freq reid-checkit (7) - 1 freq hauf-hingit (7) - 1 freq hauf-chaaed (7) - 1 freq hauf-hertit (7) - 1 freq hauf-likit (7) - 1 freq hauf-decent (8) - 1 freq han-pickit (8) - 1 freq chackit (8) - 1 freq hauf-licht (8) - 6 freq hauf-circle (8) - 1 freq hauf-expeckin (8) - 3 freq half-shapit (8) - 1 freq humfy-backit (8) - 1 freq hauf-lachin (8) - 1 freq hauf-shut (8) - 2 freq hauf-myndit (9) - 1 freq humpybackit (9) - 1 freq hauf-hopin (9) - 2 freq |
SoundEx code - H122 hauf-cock - 1 freq hauf-sax - 1 freq hapshackled - 1 freq hauf-seas - 1 freq hauf-sister - 3 freq hapshacklet - 1 freq hauf-souchin - 1 freq hauf-chackit - 1 freq hopeuchokeonyerrice - 1 freq hbcjaxry - 1 freq |
MetaPhone code - HFXKT hauf-chackit - 1 freq |
HAUF-CHACKIT |
| Time to execute Levenshtein function - 0.216566 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.412986 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.030026 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.042234 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.000931 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. |