| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pluralitie (0) - 7 freq plouralitie (1) - 2 freq pluralitié (2) - 1 freq plurality (2) - 3 freq pleuralitee (2) - 1 freq pluralité (2) - 1 freq puritie (3) - 1 freq equalitie (3) - 4 freq qualitie (3) - 12 freq pluralism (3) - 1 freq localitie (3) - 1 freq bravitie (4) - 1 freq cluitie (4) - 1 freq plaicie (4) - 1 freq prairie (4) - 1 freq plantie (4) - 2 freq plaidie (4) - 3 freq popularitie (4) - 1 freq realitie (4) - 2 freq purelie (4) - 1 freq pratie (4) - 1 freq humanitie (4) - 2 freq paralytic (4) - 2 freq parasite (4) - 3 freq qualities (4) - 9 freq |
pluralitie (0) - 7 freq plouralitie (1) - 2 freq pleuralitee (2) - 1 freq plurality (2) - 3 freq pluralitié (4) - 1 freq pluralité (4) - 1 freq pluralism (5) - 1 freq plurals (5) - 3 freq localitie (5) - 1 freq puritie (5) - 1 freq plural (5) - 56 freq platie (6) - 2 freq raelitie (6) - 2 freq parasite (6) - 3 freq pluralisation (6) - 1 freq pairlit (6) - 1 freq paralytic (6) - 2 freq loyaltie (6) - 1 freq politie (6) - 2 freq pirlit (6) - 1 freq pullit (6) - 1 freq lealtie (6) - 9 freq plantie (6) - 2 freq qualitie (6) - 12 freq popularitie (6) - 1 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 - PLRLT plurality - 3 freq pluralitie - 7 freq plouralitie - 2 freq pluralité - 1 freq pluralitié - 1 freq pleuralitee - 1 freq |
PLURALITIE |
| Time to execute Levenshtein function - 0.201923 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.367992 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.027954 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.038088 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.001091 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. |