| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repeoplin (0) - 2 freq repellin (2) - 2 freq repeople (2) - 3 freq repeopled (2) - 1 freq revealin (3) - 14 freq recoilin (3) - 1 freq revellin (3) - 3 freq resemblin (3) - 6 freq seeplin (3) - 1 freq repentin (3) - 1 freq reeshlin (3) - 6 freq reponin (3) - 2 freq feeplin (3) - 1 freq respellin (3) - 1 freq dreeplin (3) - 1 freq resellin (3) - 1 freq reelin (3) - 16 freq retellin (3) - 4 freq repeatin (3) - 24 freq reportin (3) - 15 freq zepplin (3) - 1 freq ripplin (3) - 12 freq openplan (4) - 1 freq reckonin (4) - 13 freq rehearsin (4) - 2 freq |
repeoplin (0) - 2 freq ripplin (3) - 12 freq repeopled (3) - 1 freq repeople (3) - 3 freq repellin (3) - 2 freq ripplan (4) - 2 freq zepplin (4) - 1 freq rimplin (5) - 1 freq grapplin (5) - 16 freq replyin (5) - 9 freq paplin (5) - 1 freq ripplit (5) - 1 freq rumplin (5) - 1 freq zeppelin (5) - 2 freq rappin (5) - 6 freq cripplin (5) - 3 freq rippin (5) - 21 freq replayin (5) - 1 freq appealin (5) - 6 freq papplin (5) - 2 freq appeelin (5) - 1 freq re-plooin (5) - 1 freq kipplin (5) - 1 freq rippling (5) - 1 freq reponin (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 - RPPLN repeoplin - 2 freq |
REPEOPLIN |
| Time to execute Levenshtein function - 0.293379 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.592762 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.028487 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.071829 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.000907 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. |