| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pluralité (0) - 1 freq pluralitié (1) - 1 freq pluralitie (2) - 7 freq plurality (2) - 3 freq plouralitie (3) - 2 freq penalité (3) - 1 freq pleuralitee (3) - 1 freq pluralism (3) - 1 freq plurals (4) - 3 freq plural (4) - 56 freq purity (5) - 5 freq purelie (5) - 1 freq blue-litt (5) - 1 freq plunkit (5) - 13 freq quality (5) - 138 freq pluralisation (5) - 1 freq paralytic (5) - 2 freq curlit (5) - 1 freq pairlit (5) - 1 freq purlin (5) - 1 freq penality (5) - 1 freq pourit (5) - 4 freq purlies (5) - 1 freq morality (5) - 8 freq equality (5) - 34 freq |
pluralité (0) - 1 freq pluralitié (1) - 1 freq plurality (4) - 3 freq pluralitie (4) - 7 freq pleuralitee (5) - 1 freq plouralitie (5) - 2 freq penalité (5) - 1 freq pluralism (6) - 1 freq plurals (7) - 3 freq plural (7) - 56 freq pluralisation (8) - 1 freq paralytic (8) - 2 freq truité (8) - 1 freq pirlit (8) - 1 freq pairlit (8) - 1 freq pullit (8) - 1 freq plattér (8) - 1 freq pluntit (9) - 3 freq prelatis (9) - 1 freq prayit (9) - 1 freq localitie (9) - 1 freq playit (9) - 4 freq hurlit (9) - 1 freq neutrality (9) - 2 freq legality (9) - 2 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 |
PLURALITÉ |
| Time to execute Levenshtein function - 0.263884 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.412575 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.027822 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.037377 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.000966 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. |