| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humpin (0) - 1 freq dumpin (1) - 5 freq humphin (1) - 18 freq humping (1) - 1 freq mumpin (1) - 6 freq pumpin (1) - 19 freq thumpin (1) - 19 freq bumpin (1) - 9 freq lumpin (1) - 1 freq jumpin (1) - 61 freq humpie (1) - 1 freq humpit (1) - 1 freq hummin (1) - 18 freq humbie (2) - 1 freq huchin (2) - 1 freq haepin (2) - 1 freq champin (2) - 7 freq huffin (2) - 7 freq sumkin (2) - 1 freq hurlin (2) - 21 freq thumpen (2) - 1 freq dumbin (2) - 2 freq human (2) - 317 freq humped (2) - 2 freq hunkin (2) - 1 freq |
humpin (0) - 1 freq lumpin (2) - 1 freq jumpin (2) - 61 freq hummin (2) - 18 freq bumpin (2) - 9 freq humpie (2) - 1 freq humpit (2) - 1 freq dumpin (2) - 5 freq thumpin (2) - 19 freq humphin (2) - 18 freq humping (2) - 1 freq pumpin (2) - 19 freq mumpin (2) - 6 freq happin (3) - 16 freq hippin (3) - 1 freq siumpin (3) - 1 freq heapin (3) - 2 freq gampin (3) - 1 freq hoppin (3) - 11 freq tempin (3) - 4 freq humpf (3) - 1 freq rompin (3) - 2 freq hoapin (3) - 2 freq jimpin (3) - 4 freq hump (3) - 15 freq |
SoundEx code - H515 humphin - 18 freq haun-paintet - 1 freq homophons - 1 freq hambane - 1 freq hinnae-been-arenae-bein - 1 freq hambone - 1 freq homophones - 2 freq humping - 1 freq hmvfmn - 1 freq honeypunk - 1 freq humpin - 1 freq henbane - 1 freq hunupnorth - 1 freq |
MetaPhone code - HMPN humpin - 1 freq |
HUMPIN |
| Time to execute Levenshtein function - 0.229524 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.425433 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.035865 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.041649 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.001083 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. |