| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repeopled (0) - 1 freq repeople (1) - 3 freq repeoplin (2) - 2 freq repealed (2) - 1 freq reestled (3) - 1 freq reesled (3) - 1 freq repeyed (3) - 2 freq rebelled (3) - 1 freq €˜people (3) - 1 freq reeled (3) - 6 freq reported (3) - 15 freq resembled (3) - 6 freq people (3) - 587 freq peoples (3) - 13 freq reeseled (3) - 1 freq reponed (3) - 60 freq repented (3) - 1 freq revealed (3) - 13 freq rippled (3) - 1 freq reeshled (3) - 2 freq repeated (3) - 32 freq 'people' (3) - 1 freq people' (3) - 3 freq recoiled (3) - 1 freq reeved (4) - 2 freq |
repeopled (0) - 1 freq repeople (2) - 3 freq rippled (3) - 1 freq repeoplin (3) - 2 freq repealed (3) - 1 freq rippuld (5) - 1 freq ripped (5) - 41 freq replied (5) - 240 freq replyed (5) - 9 freq appealed (5) - 7 freq rapped (5) - 4 freq rampled (5) - 1 freq ripples (5) - 8 freq ripple (5) - 7 freq pappled (5) - 2 freq dappled (5) - 4 freq toppled (5) - 3 freq grappled (5) - 1 freq crippled (5) - 2 freq recoiled (5) - 1 freq wippled (5) - 2 freq sappled (5) - 3 freq replayed (5) - 1 freq rumpled (5) - 2 freq repeyed (5) - 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 |
REPEOPLED |
| Time to execute Levenshtein function - 0.240355 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.380982 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.027892 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.038511 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.000894 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. |