| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pluralism (0) - 1 freq plurals (2) - 3 freq plurality (2) - 3 freq localism (3) - 1 freq loyalism (3) - 2 freq pluralitie (3) - 7 freq pluralité (3) - 1 freq journalism (3) - 16 freq churnalism (3) - 1 freq feudalism (3) - 1 freq plural (3) - 56 freq natralism (3) - 1 freq naturalism (3) - 1 freq dualism (3) - 1 freq publish (4) - 12 freq pluralitié (4) - 1 freq prelim (4) - 7 freq praise (4) - 106 freq purelie (4) - 1 freq jurnalist (4) - 1 freq piarais (4) - 2 freq purlies (4) - 1 freq pluribus (4) - 1 freq racism (4) - 28 freq natralist (4) - 1 freq |
pluralism (0) - 1 freq plurals (3) - 3 freq plurality (4) - 3 freq naturalism (5) - 1 freq natralism (5) - 1 freq loyalism (5) - 2 freq localism (5) - 1 freq plural (5) - 56 freq pluralitie (5) - 7 freq pluribus (6) - 1 freq prism (6) - 2 freq playlist (6) - 7 freq plagiarism (6) - 2 freq pleuralitee (6) - 1 freq plouralitie (6) - 2 freq surrealism (6) - 2 freq populism (6) - 2 freq purlies (6) - 1 freq pelmanism (6) - 1 freq lyricism (6) - 1 freq journalism (6) - 16 freq churnalism (6) - 1 freq feudalism (6) - 1 freq dualism (6) - 1 freq prelim (6) - 7 freq |
SoundEx code - P464 plurality - 3 freq plurals - 3 freq plural - 56 freq pluralism - 1 freq pluralitie - 7 freq plouralitie - 2 freq pluralité - 1 freq pluralitié - 1 freq pleuralitee - 1 freq pluralisation - 1 freq |
MetaPhone code - PLRLSM pluralism - 1 freq |
PLURALISM |
| Time to execute Levenshtein function - 0.361628 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.432024 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.037736 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.045784 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.000889 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. |