| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hemp (0) - 3 freq hmp (1) - 1 freq temp (1) - 734 freq hesp (1) - 1 freq kemp (1) - 46 freq hempt (1) - 1 freq hem (1) - 27 freq heup (1) - 1 freq hems (1) - 8 freq help (1) - 1140 freq hemm (1) - 12 freq hump (1) - 15 freq heap (1) - 46 freq haem (2) - 53 freq hek (2) - 1 freq geyp (2) - 1 freq held (2) - 509 freq leep (2) - 2 freq het (2) - 262 freq memu (2) - 1 freq herc (2) - 1 freq heat (2) - 163 freq damp (2) - 83 freq heid (2) - 3306 freq himm (2) - 1 freq |
hemp (0) - 3 freq hump (1) - 15 freq hmp (1) - 1 freq help (2) - 1140 freq hemm (2) - 12 freq heap (2) - 46 freq hoomp (2) - 1 freq hems (2) - 8 freq hempie (2) - 2 freq temp (2) - 734 freq hesp (2) - 1 freq heup (2) - 1 freq kemp (2) - 46 freq hempt (2) - 1 freq hem (2) - 27 freq hop (3) - 16 freq hame (3) - 2346 freq hemme (3) - 2 freq haap (3) - 1 freq mump (3) - 3 freq lump (3) - 62 freq hms (3) - 8 freq hym (3) - 5 freq champ (3) - 17 freq hams (3) - 10 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 |
HEMP |
| Time to execute Levenshtein function - 0.180384 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.335273 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.029051 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.037902 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.000882 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. |