| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| populatioun (0) - 1 freq population (1) - 85 freq populations (2) - 9 freq depopulation (3) - 1 freq reputatioun (3) - 2 freq prelatioun (3) - 1 freq operatioun (3) - 1 freq repopulation (3) - 1 freq adulatioun (3) - 1 freq populatit (3) - 1 freq pollution (4) - 5 freq computatiouns (4) - 1 freq poseitioun (4) - 5 freq coronatioun (4) - 1 freq populate (4) - 3 freq populous (4) - 1 freq relatioun (4) - 3 freq inflatioun (4) - 1 freq adulation (4) - 1 freq popularity (4) - 14 freq optioun (4) - 1 freq formulation (4) - 2 freq depopulaetion (4) - 1 freq popularised (4) - 1 freq operation (4) - 41 freq |
populatioun (0) - 1 freq population (1) - 85 freq populations (3) - 9 freq repopulation (4) - 1 freq populatit (4) - 1 freq prelatioun (4) - 1 freq depopulation (4) - 1 freq depopulaetion (5) - 1 freq pixelation (5) - 1 freq populated (5) - 2 freq populate (5) - 3 freq adulatioun (5) - 1 freq pollution (5) - 5 freq operatioun (5) - 1 freq reputatioun (5) - 2 freq isolatioun (6) - 1 freq reputation (6) - 30 freq regulation (6) - 4 freq speculation (6) - 5 freq appellation (6) - 4 freq proportioun (6) - 1 freq simulation (6) - 2 freq oppostion (6) - 1 freq applicatioun (6) - 1 freq apparitioun (6) - 1 freq |
SoundEx code - P143 piebald - 1 freq population - 85 freq populate - 3 freq populations - 9 freq populatit - 1 freq pappled - 2 freq pebbledash - 1 freq peeble-dash - 1 freq populated - 2 freq populatioun - 1 freq |
MetaPhone code - PPLXN population - 85 freq populatioun - 1 freq |
POPULATIOUN |
| Time to execute Levenshtein function - 0.264843 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.466047 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.030071 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.041097 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.001069 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. |