Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
demoralisan (0) - 1 freq demoralisin (1) - 1 freq demoralisinly (3) - 1 freq moralisin (3) - 1 freq decoratin (4) - 6 freq decoration (4) - 4 freq realisan (4) - 1 freq deskraiban (4) - 1 freq moralise (4) - 1 freq demolishin (4) - 1 freq memorisin (4) - 1 freq reorganisan (4) - 1 freq weiralison (4) - 3 freq demolish (4) - 2 freq democratie (5) - 3 freq desolation (5) - 2 freq verbisan (5) - 3 freq morrison (5) - 28 freq derlin (5) - 1 freq raisan (5) - 3 freq democracies (5) - 1 freq semolina (5) - 5 freq democracie (5) - 1 freq memorised (5) - 2 freq dealin (5) - 30 freq |
demoralisan (0) - 1 freq demoralisin (1) - 1 freq moralisin (4) - 1 freq demoralisinly (4) - 1 freq memorisin (6) - 1 freq weiralison (6) - 3 freq demolish (6) - 2 freq demolishin (6) - 1 freq moralise (6) - 1 freq realisan (6) - 1 freq realisin (7) - 14 freq depressan (7) - 1 freq momorrison (7) - 1 freq morison (7) - 1 freq admirals (7) - 2 freq morales (7) - 1 freq mmorrison (7) - 1 freq demolition (7) - 2 freq realisn (7) - 2 freq morals (7) - 10 freq decoration (7) - 4 freq decoratin (7) - 6 freq remorsin (7) - 1 freq memorials (7) - 4 freq donmorrison (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 |
DEMORALISAN |
Time to execute Levenshtein function - 0.290607 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.429197 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.031082 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.042898 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.001029 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. |