| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hempt (0) - 1 freq heapt (1) - 1 freq hemp (1) - 3 freq tempt (1) - 9 freq helpt (1) - 9 freq hem't (1) - 1 freq humps (2) - 3 freq cept (2) - 25 freq heips (2) - 2 freq heist (2) - 8 freq ept (2) - 1 freq kempy (2) - 2 freq dampt (2) - 3 freq heap (2) - 46 freq help (2) - 1140 freq helmet (2) - 15 freq jimpt (2) - 1 freq hmdt (2) - 1 freq demit (2) - 2 freq helpit (2) - 52 freq heat (2) - 163 freq halpt (2) - 1 freq emit (2) - 4 freq jampt (2) - 1 freq keypt (2) - 1 freq |
hempt (0) - 1 freq humpit (2) - 1 freq humpty (2) - 7 freq helpt (2) - 9 freq hem't (2) - 1 freq tempt (2) - 9 freq heapt (2) - 1 freq hemp (2) - 3 freq campt (3) - 2 freq hmp (3) - 1 freq empty (3) - 213 freq tempit (3) - 11 freq hmph (3) - 1 freq heapit (3) - 4 freq kempit (3) - 2 freq howpt (3) - 1 freq humpf (3) - 1 freq exempt (3) - 12 freq humph (3) - 15 freq happt (3) - 14 freq lempit (3) - 2 freq pumpt (3) - 1 freq mumpt (3) - 2 freq hump (3) - 15 freq hmt (3) - 1 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 |
HEMPT |
| Time to execute Levenshtein function - 0.203067 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.345781 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.028007 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.038095 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.000899 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. |