| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humor (0) - 1 freq humour (1) - 69 freq humer (1) - 1 freq amor (2) - 1 freq timor (2) - 1 freq humpf (2) - 1 freq homer (2) - 1 freq uimor (2) - 1 freq humps (2) - 3 freq tutor (2) - 9 freq human (2) - 315 freq stumor (2) - 1 freq tudor (2) - 6 freq kumar (2) - 1 freq mor (2) - 15 freq hmo (2) - 1 freq hurr (2) - 1 freq humza (2) - 2 freq hum (2) - 44 freq humfy (2) - 1 freq umour (2) - 1 freq juror (2) - 6 freq hummer (2) - 2 freq honor (2) - 2 freq rumour (2) - 21 freq |
humor (0) - 1 freq humour (1) - 69 freq humer (1) - 1 freq homer (2) - 1 freq hamar (2) - 5 freq tumour (3) - 6 freq hummy (3) - 1 freq hums (3) - 3 freq humber (3) - 2 freq honor (3) - 2 freq rumour (3) - 21 freq hume (3) - 10 freq hump (3) - 15 freq hoor (3) - 62 freq humours (3) - 1 freq homo (3) - 3 freq memor (3) - 1 freq sumer (3) - 1 freq umour (3) - 1 freq hur (3) - 787 freq hummer (3) - 2 freq amor (3) - 1 freq kumar (3) - 1 freq timor (3) - 1 freq human (3) - 315 freq |
SoundEx code - H560 hemmer - 21 freq hunner - 434 freq hinry - 1 freq homer - 1 freq houane'er - 12 freq honour - 94 freq haimmer - 30 freq henry - 43 freq hammer - 44 freq henner - 3 freq humer - 1 freq humour - 69 freq 'hunner - 2 freq hinner - 46 freq 'honour - 2 freq honoria - 1 freq hummer - 2 freq 'henri - 1 freq 'henri' - 1 freq hunnér - 3 freq hunnèr - 24 freq hammer' - 2 freq hinnèr - 1 freq hamar - 5 freq hameower - 3 freq honorre - 1 freq 'honore - 1 freq honoré - 10 freq honor - 2 freq henri - 1 freq €˜humour - 1 freq €™henry - 5 freq 'hunner' - 1 freq himmer - 1 freq humor - 1 freq humourÂ’ - 1 freq henry' - 1 freq henery - 1 freq haimer - 2 freq |
MetaPhone code - HMR hemmer - 21 freq homer - 1 freq haimmer - 30 freq humber - 2 freq hammer - 44 freq humer - 1 freq humour - 69 freq hummer - 2 freq hammer' - 2 freq hamar - 5 freq €˜humour - 1 freq himmer - 1 freq humor - 1 freq humourÂ’ - 1 freq haimer - 2 freq |
HUMOR |
| Time to execute Levenshtein function - 0.179016 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.365910 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.027921 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.042495 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.000791 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. |