| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| popularity (0) - 14 freq popularitie (2) - 1 freq jocularity (2) - 1 freq populatit (2) - 1 freq popularly (2) - 1 freq popular (3) - 100 freq population (3) - 85 freq popularised (3) - 1 freq populate (3) - 3 freq populatioun (4) - 1 freq populated (4) - 2 freq populist (4) - 6 freq vulgarity (4) - 1 freq populations (4) - 9 freq clarity (4) - 13 freq plurality (4) - 3 freq polity (4) - 4 freq posterity (4) - 8 freq parity (4) - 2 freq poplars (4) - 2 freq pourit (4) - 4 freq populism (4) - 2 freq probulary (4) - 2 freq unpopulatit (4) - 1 freq purity (4) - 5 freq |
popularity (0) - 14 freq popularitie (2) - 1 freq populatit (3) - 1 freq popularly (3) - 1 freq jocularity (4) - 1 freq popular (4) - 100 freq populate (4) - 3 freq poplar (5) - 1 freq populist (5) - 6 freq popularised (5) - 1 freq population (5) - 85 freq poplars (5) - 2 freq unpopulatit (6) - 1 freq appearit (6) - 5 freq purity (6) - 5 freq similarity (6) - 2 freq populism (6) - 2 freq hilarity (6) - 5 freq polaris (6) - 3 freq populace (6) - 6 freq parity (6) - 2 freq populated (6) - 2 freq clarity (6) - 13 freq pourit (6) - 4 freq plurality (6) - 3 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 |
POPULARITY |
| Time to execute Levenshtein function - 0.215093 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.375044 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.027432 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.037267 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.000928 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. |