| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| depopulaetion (0) - 1 freq depopulation (1) - 1 freq repopulation (2) - 1 freq population (3) - 85 freq deportation (4) - 1 freq despoilation (4) - 1 freq desolation (4) - 2 freq populations (4) - 9 freq populatioun (4) - 1 freq demoleetion (4) - 1 freq ejaculation (5) - 1 freq populatit (5) - 1 freq deprecation (5) - 1 freq regulation (5) - 4 freq deletion (5) - 1 freq devolution (5) - 31 freq manipulation (5) - 2 freq unpopulatit (5) - 1 freq desperation (5) - 20 freq demonstraetion (5) - 1 freq deflation (5) - 1 freq decoration (5) - 4 freq replicaetion (5) - 1 freq reputation (5) - 30 freq revelaetion (5) - 1 freq |
depopulaetion (0) - 1 freq depopulation (1) - 1 freq repopulation (3) - 1 freq population (4) - 85 freq despoilation (5) - 1 freq populatioun (5) - 1 freq desolation (6) - 2 freq deportation (6) - 1 freq demoleetion (6) - 1 freq populations (6) - 9 freq deflation (7) - 1 freq desperation (7) - 20 freq demolition (7) - 2 freq speculation (7) - 5 freq unpopulatit (7) - 1 freq deprivation (7) - 11 freq desolautioun (7) - 1 freq devolution (7) - 31 freq deprecation (7) - 1 freq populatit (7) - 1 freq deletion (7) - 1 freq repopulate (7) - 1 freq manipulation (7) - 2 freq populated (8) - 2 freq devolutioun (8) - 1 freq |
SoundEx code - D114 depopulaetion - 1 freq depopulation - 1 freq davevallis - 1 freq |
MetaPhone code - TPPLXN depopulaetion - 1 freq depopulation - 1 freq |
DEPOPULAETION |
| Time to execute Levenshtein function - 0.241403 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.526638 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.029338 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.043258 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.001153 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. |