| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| malevolence (0) - 4 freq malevolent (2) - 3 freq benevolence (3) - 1 freq prevalence (4) - 1 freq avidence (5) - 2 freq maleen (5) - 1 freq leishence (5) - 4 freq raference (5) - 1 freq resemblence (5) - 1 freq seilence (5) - 6 freq excellence (5) - 23 freq eevidence (5) - 1 freq indolence (5) - 1 freq seelence (5) - 1 freq tolerence (5) - 1 freq coalescence (5) - 1 freq veelence (5) - 1 freq relevance (5) - 5 freq benevolent (5) - 4 freq half-ounce (5) - 1 freq halfpence (5) - 1 freq allouance (5) - 3 freq evidence (5) - 151 freq violence (5) - 37 freq milestene (5) - 1 freq |
malevolence (0) - 4 freq malevolent (3) - 3 freq benevolence (5) - 1 freq prevalence (6) - 1 freq allooance (7) - 1 freq violence (7) - 37 freq allouance (7) - 3 freq veelence (7) - 1 freq ballance (7) - 1 freq flatulence (7) - 3 freq sellence (7) - 1 freq lvidence (7) - 1 freq relevance (7) - 5 freq malone (8) - 4 freq seelence (8) - 67 freq malverse (8) - 2 freq insolence (8) - 4 freq irreverence (8) - 1 freq leeshence (8) - 1 freq malcolme (8) - 1 freq flatulunce (8) - 2 freq cleveland (8) - 1 freq millenia (8) - 2 freq ambulance (8) - 37 freq deliverance (8) - 4 freq |
SoundEx code - M414 malevolence - 4 freq melville's's - 1 freq melville - 1 freq malleable - 2 freq malevolent - 3 freq millfield - 2 freq |
MetaPhone code - MLFLNS malevolence - 4 freq |
MALEVOLENCE |
| Time to execute Levenshtein function - 0.203745 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.361533 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.027083 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.036672 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.000883 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. |