| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repopulate (0) - 1 freq populate (2) - 3 freq regulate (3) - 3 freq repopulation (3) - 1 freq populace (3) - 6 freq populated (3) - 2 freq sporulate (3) - 1 freq depopulation (4) - 1 freq renovate (4) - 1 freq populatit (4) - 1 freq reprobate (4) - 1 freq popular (4) - 100 freq unpopular (4) - 3 freq resonate (4) - 1 freq repeople (4) - 3 freq repute (4) - 12 freq reporte (4) - 1 freq ejaculate (4) - 1 freq capitulate (4) - 1 freq regalate (4) - 1 freq aeroplane (4) - 14 freq emulate (4) - 2 freq relocate (4) - 2 freq desolate (4) - 3 freq speculate (4) - 6 freq |
repopulate (0) - 1 freq populate (3) - 3 freq repopulation (4) - 1 freq ripplit (5) - 1 freq repeople (5) - 3 freq sporulate (5) - 1 freq populated (5) - 2 freq regulate (5) - 3 freq populace (5) - 6 freq replete (5) - 1 freq spatulate (6) - 1 freq resolute (6) - 8 freq unpopulatit (6) - 1 freq replicate (6) - 2 freq template (6) - 6 freq relate (6) - 18 freq repeopled (6) - 1 freq ripple (6) - 7 freq raphaelite (6) - 1 freq repeoplin (6) - 2 freq speculate (6) - 6 freq replace (6) - 21 freq rippuld (6) - 1 freq manipulate (6) - 2 freq ripplan (6) - 2 freq |
SoundEx code - R114 republic - 26 freq republics - 2 freq revival - 57 freq republican - 8 freq 'revival' - 1 freq republicanism - 2 freq republicanes - 1 freq republicatioun - 2 freq re-publisht - 2 freq republicans - 1 freq repeoplin - 2 freq repeopled - 1 freq repeople - 3 freq repopulate - 1 freq repopulation - 1 freq revivalism - 1 freq revivals - 1 freq republic - 1 freq |
MetaPhone code - RPPLT repeopled - 1 freq repopulate - 1 freq |
REPOPULATE |
| Time to execute Levenshtein function - 0.234151 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.422878 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.030240 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.040780 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.000954 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. |