| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humiliation (0) - 5 freq humiliatit (2) - 2 freq humiliating (2) - 1 freq mutilation (3) - 2 freq humiliated (3) - 1 freq humilitie (3) - 1 freq humiliate (3) - 2 freq immigration (4) - 6 freq summation (4) - 1 freq mitigation (4) - 2 freq supplication (4) - 2 freq nomination (4) - 1 freq hesitation (4) - 12 freq migration (4) - 10 freq humility (4) - 2 freq mediation (4) - 4 freq habitation (4) - 6 freq implication (4) - 3 freq initiation (4) - 2 freq domination (4) - 1 freq demolition (4) - 2 freq limitation (4) - 1 freq complication (4) - 2 freq publication (4) - 42 freq imitation (4) - 4 freq |
humiliation (0) - 5 freq humiliating (3) - 1 freq humiliatit (3) - 2 freq humiliate (4) - 2 freq humilitie (4) - 1 freq hamilton (4) - 40 freq humiliated (4) - 1 freq simulation (5) - 2 freq mutilation (5) - 2 freq demolition (5) - 2 freq humelitie (5) - 1 freq humility (5) - 2 freq milton (6) - 4 freq compilation (6) - 2 freq demoleetion (6) - 1 freq imitation (6) - 4 freq hilton (6) - 2 freq lamination (6) - 1 freq hilltoon (6) - 1 freq homologatin (6) - 1 freq admiration (6) - 13 freq retaliation (6) - 2 freq exfoliation (6) - 1 freq summation (6) - 1 freq hesitation (6) - 12 freq |
SoundEx code - H543 haimelt - 5 freq hamelt - 72 freq hummlt - 3 freq hamilton - 40 freq haunled - 8 freq hamlets - 1 freq hummelt - 2 freq humiliatit - 2 freq humilitie - 1 freq humiliate - 2 freq humiliation - 5 freq hamlet's - 1 freq han-waaled - 2 freq humiliating - 1 freq han'led - 1 freq hum'led - 1 freq humiliated - 1 freq hamilton-megommerie - 1 freq humility - 2 freq hummled - 1 freq hannled - 2 freq hameilt - 1 freq 'hamlet' - 1 freq hamlet - 10 freq humelitie - 1 freq haunlit - 1 freq haunnilt - 1 freq hamilt - 1 freq haunnelt - 1 freq haunlet - 2 freq hamilton's - 3 freq hameldaeme - 1 freq hamiltondecor - 9 freq |
MetaPhone code - HMLXN humiliation - 5 freq |
HUMILIATION |
| Time to execute Levenshtein function - 0.211708 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.364295 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.027266 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.036623 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.000821 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. |