| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humpie (0) - 1 freq humpit (1) - 1 freq humbie (1) - 1 freq pumpie (1) - 2 freq dumpie (1) - 1 freq humpin (1) - 1 freq hempie (1) - 2 freq hurdie (2) - 4 freq mumpin (2) - 6 freq howpie (2) - 1 freq aumrie (2) - 3 freq hume (2) - 10 freq humpf (2) - 1 freq humane (2) - 4 freq hurple (2) - 1 freq humps (2) - 3 freq hughie (2) - 107 freq sumwie (2) - 1 freq huddie (2) - 2 freq yuppie (2) - 1 freq hump (2) - 15 freq happie (2) - 13 freq sumphie (2) - 1 freq suppie (2) - 24 freq gumlie (2) - 4 freq |
humpie (0) - 1 freq hempie (1) - 2 freq humbie (2) - 1 freq hump (2) - 15 freq humpit (2) - 1 freq humpin (2) - 1 freq pumpie (2) - 2 freq dumpie (2) - 1 freq humphy (3) - 52 freq kempie (3) - 1 freq happie (3) - 13 freq heapie (3) - 1 freq hempies (3) - 2 freq hippie (3) - 3 freq empie (3) - 25 freq hemp (3) - 3 freq jumpe (3) - 1 freq humped (3) - 2 freq campie (3) - 16 freq hmp (3) - 1 freq humpty (3) - 7 freq humpf (3) - 1 freq humps (3) - 3 freq hume (3) - 10 freq howpie (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 humf - 1 freq haunfae - 9 freq humph - 15 freq hanfu - 10 freq hanf - 2 freq hmv - 2 freq hmyv - 1 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 - HMP hump - 15 freq hemp - 3 freq humpie - 1 freq hempie - 2 freq hoomp - 1 freq |
HUMPIE |
| Time to execute Levenshtein function - 0.234586 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.391611 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.031440 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.056777 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.001280 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. |