| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| parallelism (0) - 1 freq parallels (2) - 6 freq parallel (3) - 21 freq parables (4) - 9 freq paradeis (4) - 1 freq parable's (4) - 1 freq paralysis (4) - 1 freq paramedic (5) - 4 freq paralytic (5) - 2 freq careerism (5) - 1 freq warliewise (5) - 1 freq natralism (5) - 1 freq pragmatism (5) - 1 freq parasols (5) - 2 freq evangelism (5) - 1 freq pluralism (5) - 1 freq miralles (5) - 2 freq pallets (5) - 7 freq parcels (5) - 4 freq parable (5) - 54 freq paramedics (5) - 2 freq paralytics (5) - 1 freq prelim (5) - 7 freq parapets (5) - 1 freq paralympics (5) - 1 freq |
parallelism (0) - 1 freq parallels (3) - 6 freq parallel (5) - 21 freq parochialism (7) - 2 freq paralysis (7) - 1 freq pluralism (7) - 1 freq parable's (7) - 1 freq parables (7) - 9 freq paralytics (8) - 1 freq pallets (8) - 7 freq prelim (8) - 7 freq paralysin (8) - 2 freq proclemis (8) - 1 freq marvilliss (8) - 1 freq miralles (8) - 2 freq paradeis (8) - 1 freq parcels (8) - 4 freq paraleesed (8) - 4 freq palladium (8) - 1 freq pragmatism (8) - 1 freq parasols (8) - 2 freq pillls (8) - 1 freq parklans (9) - 1 freq proablem (9) - 4 freq pulleys (9) - 2 freq |
SoundEx code - P644 parallel - 21 freq parallels - 6 freq parallelism - 1 freq |
MetaPhone code - PRLLSM parallelism - 1 freq |
PARALLELISM |
| Time to execute Levenshtein function - 0.351697 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.458740 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.028204 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.038277 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.000914 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. |