| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humpty (0) - 7 freq dumpty (1) - 6 freq numpty (1) - 29 freq humphy (1) - 52 freq lumpy (2) - 4 freq hummly (2) - 1 freq hempt (2) - 1 freq humph (2) - 14 freq humpit (2) - 1 freq mumpt (2) - 2 freq impty (2) - 14 freq humps (2) - 3 freq humpie (2) - 1 freq humfy (2) - 1 freq huppity (2) - 1 freq dumphy (2) - 50 freq humpin (2) - 1 freq humped (2) - 2 freq jumpt (2) - 8 freq humphd (2) - 1 freq hummy (2) - 1 freq humbly (2) - 6 freq humpf (2) - 1 freq jumpy (2) - 2 freq hump (2) - 15 freq |
humpty (0) - 7 freq humpit (2) - 1 freq humphy (2) - 52 freq hempt (2) - 1 freq dumpty (2) - 6 freq numpty (2) - 29 freq humped (3) - 2 freq humpin (3) - 1 freq jumpt (3) - 8 freq empty (3) - 207 freq hump (3) - 15 freq pumpt (3) - 1 freq huppity (3) - 1 freq humpf (3) - 1 freq mumpt (3) - 2 freq impty (3) - 14 freq humps (3) - 3 freq humph (3) - 14 freq humpie (3) - 1 freq houmit (4) - 1 freq hem't (4) - 1 freq bumpit (4) - 4 freq hopt (4) - 1 freq humanity (4) - 30 freq thumpit (4) - 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 - HMPT humpit - 1 freq humpty - 7 freq hempt - 1 freq humped - 2 freq |
HUMPTY |
| Time to execute Levenshtein function - 0.173786 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.324631 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.027455 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.036828 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.000803 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. |