| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| popularitie (0) - 1 freq popularity (2) - 14 freq popularised (3) - 1 freq populate (3) - 3 freq populatit (3) - 1 freq popularly (4) - 1 freq populations (4) - 9 freq popular (4) - 100 freq populated (4) - 2 freq population (4) - 85 freq puritie (4) - 1 freq plouralitie (4) - 2 freq popularisation (4) - 1 freq politie (4) - 2 freq polatie (4) - 1 freq pluralitie (4) - 7 freq peculiarities (4) - 1 freq jocularity (4) - 1 freq populatioun (4) - 1 freq polarisin (4) - 1 freq populace (4) - 6 freq charitie (5) - 2 freq poplars (5) - 2 freq qualitie (5) - 12 freq policie (5) - 23 freq |
popularitie (0) - 1 freq popularity (2) - 14 freq populate (4) - 3 freq populatit (4) - 1 freq popular (5) - 100 freq popularised (5) - 1 freq popularly (5) - 1 freq jocularity (6) - 1 freq peculiarities (6) - 1 freq populace (6) - 6 freq poplar (6) - 1 freq pluralitie (6) - 7 freq poplars (6) - 2 freq populist (6) - 6 freq populatioun (6) - 1 freq puritie (6) - 1 freq populated (6) - 2 freq polatie (6) - 1 freq plouralitie (6) - 2 freq population (6) - 85 freq politie (6) - 2 freq popularisation (6) - 1 freq populism (7) - 2 freq repopulate (7) - 1 freq polaroid (7) - 1 freq |
SoundEx code - P146 popular - 100 freq poplar - 1 freq poplars - 2 freq popularly - 1 freq popularity - 14 freq popularitie - 1 freq popularisation - 1 freq popularised - 1 freq popular - 1 freq |
MetaPhone code - PPLRT popularity - 14 freq popularitie - 1 freq |
POPULARITIE |
| Time to execute Levenshtein function - 0.235616 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.422717 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.030433 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.039881 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.000960 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. |