| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humpty-dumpty (0) - 2 freq rumpy-pumpy (4) - 1 freq heavy-duty (6) - 2 freq hauf-empty (7) - 1 freq hurly-burly (7) - 3 freq luvvy-duvvy (7) - 1 freq humphy-backit (7) - 6 freq humpty (7) - 7 freq dumpty (7) - 6 freq hoity-toity (7) - 3 freq hunky-dory (7) - 3 freq humpybackit (7) - 1 freq hilty-skilty (7) - 1 freq hippy-hoppy (7) - 1 freq jumped-up (7) - 1 freq hunkey-dory (7) - 1 freq happt-up (7) - 1 freq puppy-dug's (7) - 1 freq super-duper (7) - 1 freq puppy-dug (7) - 3 freq half-empty (7) - 1 freq mutton-dummy (7) - 1 freq stumpy (8) - 4 freq sumtums (8) - 2 freq cutty-clay (8) - 1 freq |
humpty-dumpty (0) - 2 freq rumpy-pumpy (8) - 1 freq half-empty (11) - 1 freq happt-up (11) - 1 freq humphy-backit (11) - 6 freq hauf-empty (11) - 1 freq heavy-duty (11) - 2 freq mutton-dummy (12) - 1 freq super-duper (12) - 1 freq impromptu (12) - 2 freq jumped-up (12) - 1 freq humpie-backit (12) - 1 freq hert-peety (12) - 1 freq happit-up (12) - 1 freq mup-mups (12) - 1 freq dumpty (12) - 6 freq humpty (12) - 7 freq humpybackit (12) - 1 freq hoity-toity (12) - 3 freq hippy-hoppy (12) - 1 freq hilty-skilty (12) - 1 freq stumpt (13) - 1 freq hame-cumin (13) - 1 freq humfy-backit (13) - 1 freq mumpt (13) - 2 freq |
SoundEx code - H513 humphed - 9 freq humphd - 1 freq hamebidin - 1 freq hampden - 15 freq humpit - 1 freq humpty - 7 freq haun-fudge - 1 freq hameaboot - 1 freq hinny-pot - 1 freq humpty-dumpty - 2 freq humphit - 1 freq hame-aboot - 3 freq hempt - 1 freq haemaboot - 1 freq humped - 2 freq €œhampden - 1 freq hampdeners - 1 freq hampdenroarpod - 1 freq |
MetaPhone code - HMPTTMPT humpty-dumpty - 2 freq |
HUMPTY-DUMPTY |
| Time to execute Levenshtein function - 0.214726 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.490953 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.031994 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.039468 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.000883 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. |