| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| popularisation (0) - 1 freq pluralisation (4) - 1 freq population (4) - 85 freq popularitie (4) - 1 freq secularisatioun (4) - 1 freq popularity (5) - 14 freq pollination (5) - 1 freq organisation (5) - 29 freq staunardisation (5) - 8 freq ogranisation (5) - 1 freq localisation (5) - 4 freq populatioun (5) - 1 freq popularised (5) - 1 freq polarisin (5) - 1 freq populations (5) - 9 freq normalisation (5) - 2 freq colonisation (5) - 2 freq pro-unification (6) - 1 freq profitisation (6) - 3 freq bastardisation (6) - 1 freq publication (6) - 42 freq collaboration (6) - 5 freq quaistion (6) - 21 freq lamination (6) - 1 freq toleration (6) - 2 freq |
popularisation (0) - 1 freq secularisatioun (6) - 1 freq popularitie (6) - 1 freq pluralisation (6) - 1 freq population (6) - 85 freq polarisin (7) - 1 freq popularised (7) - 1 freq populatioun (7) - 1 freq popularity (7) - 14 freq apparition (8) - 3 freq colonisation (8) - 2 freq populations (8) - 9 freq application (8) - 24 freq pollination (8) - 1 freq pulsatin (8) - 3 freq localisation (8) - 4 freq populist (8) - 6 freq exploration (8) - 9 freq implication (9) - 3 freq separation (9) - 5 freq repopulation (9) - 1 freq depopulation (9) - 1 freq realisation (9) - 22 freq plantation (9) - 12 freq supplication (9) - 2 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 - PPLRSXN popularisation - 1 freq |
POPULARISATION |
| Time to execute Levenshtein function - 0.385983 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.641871 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.065305 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.038490 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.000862 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. |