| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| demoralisin (0) - 1 freq demoralisan (1) - 1 freq demoralisinly (2) - 1 freq moralisin (2) - 1 freq demolishin (3) - 1 freq memorisin (3) - 1 freq normalisin (4) - 1 freq ceevalisin (4) - 1 freq decoratin (4) - 6 freq remorsin (4) - 1 freq moralistic (4) - 1 freq moralise (4) - 1 freq realisin (4) - 14 freq demolish (4) - 2 freq emphasisin (4) - 3 freq weiralison (4) - 3 freq revitalisin (4) - 4 freq decoration (4) - 4 freq demolition (4) - 2 freq demolishit (4) - 1 freq reorganisin (4) - 1 freq democracies (5) - 1 freq immortalitie (5) - 1 freq draigin (5) - 3 freq realisan (5) - 1 freq |
demoralisin (0) - 1 freq demoralisan (1) - 1 freq moralisin (3) - 1 freq demoralisinly (3) - 1 freq memorisin (5) - 1 freq demolishin (5) - 1 freq realisin (6) - 14 freq weiralison (6) - 3 freq demolition (6) - 2 freq moralise (6) - 1 freq demolish (6) - 2 freq remorsin (6) - 1 freq depressin (7) - 26 freq admirals (7) - 2 freq paralysin (7) - 2 freq morrison (7) - 28 freq morison (7) - 1 freq derlin (7) - 1 freq momorrison (7) - 1 freq derision (7) - 8 freq dimoleishin (7) - 1 freq symbolisin (7) - 1 freq morals (7) - 10 freq memorials (7) - 4 freq morresin (7) - 1 freq |
SoundEx code - D564 demoralisinly - 1 freq demoralisin - 1 freq dinner-lady's - 1 freq demoralisan - 1 freq |
MetaPhone code - TMRLSN demoralisin - 1 freq demoralisan - 1 freq |
DEMORALISIN |
| Time to execute Levenshtein function - 0.270220 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.442070 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.028579 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.039056 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.000885 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. |