| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| morality (0) - 8 freq mortality (1) - 12 freq modality (1) - 2 freq normality (2) - 9 freq moralise (2) - 1 freq mobility (2) - 6 freq locality (2) - 3 freq morally (2) - 3 freq formality (2) - 4 freq mortally (3) - 1 freq immortality (3) - 5 freq furmality (3) - 1 freq polity (3) - 4 freq vitality (3) - 4 freq morals (3) - 10 freq monolith (3) - 2 freq moralisin (3) - 1 freq mentality (3) - 9 freq mortify (3) - 1 freq reality (3) - 115 freq hoalidy (3) - 2 freq equality (3) - 34 freq veracity (3) - 2 freq metaility (3) - 1 freq malty (3) - 6 freq |
morality (0) - 8 freq modality (2) - 2 freq mortality (2) - 12 freq marlit (3) - 1 freq morally (3) - 3 freq moralise (3) - 1 freq mobility (3) - 6 freq morale (4) - 6 freq moonlit (4) - 5 freq moral (4) - 88 freq malty (4) - 6 freq morals (4) - 10 freq marlt (4) - 2 freq reality (4) - 115 freq royalty (4) - 24 freq formality (4) - 4 freq locality (4) - 3 freq normality (4) - 9 freq mirlt (4) - 1 freq morales (4) - 1 freq fraility (4) - 1 freq metaility (4) - 1 freq raelity (4) - 1 freq hurlit (5) - 1 freq markit (5) - 18 freq |
SoundEx code - M643 marlt - 2 freq mirlt - 1 freq murled - 1 freq marled - 2 freq morality - 8 freq marlit - 1 freq mirled - 2 freq marlled - 1 freq |
MetaPhone code - MRLT marlt - 2 freq mirlt - 1 freq murled - 1 freq marled - 2 freq morality - 8 freq marlit - 1 freq mirled - 2 freq marlled - 1 freq |
MORALITY |
| Time to execute Levenshtein function - 0.205009 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.374995 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.027519 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.038483 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.000871 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. |