| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hump (0) - 15 freq jump (1) - 85 freq hup (1) - 6 freq humph (1) - 15 freq dump (1) - 31 freq sump (1) - 3 freq hume (1) - 10 freq thump (1) - 33 freq rump (1) - 10 freq bump (1) - 23 freq mump (1) - 3 freq hmp (1) - 1 freq hemp (1) - 3 freq hums (1) - 3 freq tump (1) - 1 freq humf (1) - 1 freq lump (1) - 62 freq humpf (1) - 1 freq whump (1) - 2 freq pump (1) - 31 freq cump (1) - 1 freq hum (1) - 45 freq gump (1) - 1 freq humps (1) - 3 freq aums (2) - 1 freq |
hump (0) - 15 freq hmp (1) - 1 freq hemp (1) - 3 freq lump (2) - 62 freq humpf (2) - 1 freq whump (2) - 2 freq humf (2) - 1 freq cump (2) - 1 freq humpie (2) - 1 freq hoomp (2) - 1 freq humps (2) - 3 freq gump (2) - 1 freq tump (2) - 1 freq pump (2) - 31 freq hum (2) - 45 freq dump (2) - 31 freq hums (2) - 3 freq hup (2) - 6 freq jump (2) - 85 freq sump (2) - 3 freq humph (2) - 15 freq mump (2) - 3 freq bump (2) - 23 freq rump (2) - 10 freq thump (2) - 33 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 |
HUMP |
| Time to execute Levenshtein function - 0.282406 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.600382 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.076312 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.036890 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. |