| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humph (0) - 14 freq hmmph (1) - 8 freq humpf (1) - 1 freq gumph (1) - 1 freq humphs (1) - 2 freq hmph (1) - 1 freq bumph (1) - 3 freq humps (1) - 3 freq mumph (1) - 1 freq humphy (1) - 52 freq sumph (1) - 21 freq humphd (1) - 1 freq hump (1) - 15 freq mmph (2) - 2 freq sumps (2) - 1 freq hutch (2) - 7 freq thump (2) - 32 freq pumps (2) - 12 freq grumph (2) - 15 freq bumpy (2) - 1 freq imph (2) - 1 freq dump (2) - 30 freq humphed (2) - 9 freq thumps (2) - 3 freq huh (2) - 15 freq |
humph (0) - 14 freq humphy (1) - 52 freq hmph (1) - 1 freq mumph (2) - 1 freq sumph (2) - 21 freq humphd (2) - 1 freq humps (2) - 3 freq hump (2) - 15 freq bumph (2) - 3 freq hmmph (2) - 8 freq humpf (2) - 1 freq humphs (2) - 2 freq gumph (2) - 1 freq oomph (3) - 4 freq nymph (3) - 2 freq humped (3) - 2 freq humphin (3) - 17 freq hemp (3) - 3 freq humpie (3) - 1 freq humphit (3) - 1 freq mph (3) - 2 freq hmp (3) - 1 freq humpty (3) - 7 freq humpit (3) - 1 freq humpin (3) - 1 freq |
SoundEx code - H510 hanfae - 3 freq hmph - 1 freq haanfae - 6 freq hump - 15 freq hmmph - 8 freq 'hmmph - 2 freq haunfu - 8 freq haunfa - 1 freq hemp - 3 freq humpf - 1 freq humpie - 1 freq hanfu - 10 freq hanf - 2 freq humph - 14 freq hmv - 2 freq hmyv - 1 freq haunfae - 8 freq humphy - 52 freq hamnivo - 1 freq hamnavoe - 4 freq hyne-aff - 1 freq hempie - 2 freq humbie - 1 freq hinny-bee - 1 freq hmfff - 1 freq humfy - 1 freq hmbbw - 1 freq hoomp - 1 freq hmmmph - 1 freq hannahb - 6 freq hanfu - 1 freq hnb - 1 freq hmp - 1 freq |
MetaPhone code - HMF humph - 14 freq humphy - 52 freq humfy - 1 freq |
HUMPH |
| Time to execute Levenshtein function - 0.205891 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.359988 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.028137 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.037917 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.000915 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. |