| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| populations (0) - 9 freq population (1) - 84 freq populatioun (2) - 1 freq speculations (3) - 1 freq amputations (3) - 1 freq repopulation (3) - 1 freq depopulation (3) - 1 freq populatit (3) - 1 freq reputations (3) - 1 freq regulations (3) - 5 freq operations (3) - 8 freq motivations (4) - 2 freq proportions (4) - 5 freq occupations (4) - 4 freq speculation (4) - 5 freq polaties (4) - 1 freq compulsions (4) - 1 freq prostrations (4) - 1 freq platoons (4) - 2 freq insulation (4) - 1 freq pixelation (4) - 1 freq situations (4) - 20 freq solutions (4) - 20 freq potions (4) - 11 freq populous (4) - 1 freq |
populations (0) - 9 freq population (2) - 84 freq populatioun (3) - 1 freq regulations (5) - 5 freq reputations (5) - 1 freq platoons (5) - 2 freq populatit (5) - 1 freq operations (5) - 8 freq depopulation (5) - 1 freq speculations (5) - 1 freq amputations (5) - 1 freq repopulation (5) - 1 freq populated (6) - 2 freq dilations (6) - 1 freq relations (6) - 14 freq poseitions (6) - 3 freq aspirations (6) - 9 freq populate (6) - 3 freq raigulations (6) - 1 freq pollution (6) - 5 freq peculators (6) - 1 freq preparations (6) - 7 freq revelations (6) - 1 freq options (6) - 27 freq coalitions (6) - 1 freq |
SoundEx code - P143 piebald - 1 freq population - 84 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 - PPLXNS populations - 9 freq |
POPULATIONS |
| Time to execute Levenshtein function - 0.514467 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 - 1.073707 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.027950 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.188581 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.001006 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. |