| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sermaple (0) - 1 freq semple (2) - 24 freq sample (3) - 19 freq maple (3) - 6 freq shemale (3) - 1 freq mermarble (3) - 1 freq sirple (3) - 2 freq serial (3) - 3 freq servile (3) - 1 freq seeable (3) - 1 freq female (3) - 74 freq smale (3) - 1 freq sempler (3) - 2 freq semply (3) - 2 freq simple (3) - 205 freq scrape (3) - 29 freq staple (3) - 6 freq saumple (3) - 2 freq germane (3) - 1 freq semplie (3) - 2 freq permeable (3) - 1 freq germanie (3) - 4 freq servaice (3) - 1 freq temple (3) - 86 freq straachle (4) - 2 freq |
sermaple (0) - 1 freq semple (3) - 24 freq sirple (4) - 2 freq semply (4) - 2 freq semplie (4) - 2 freq simple (4) - 205 freq sample (4) - 19 freq saumple (4) - 2 freq permeable (5) - 1 freq sempil (5) - 8 freq simply (5) - 123 freq trumple (5) - 1 freq frumple (5) - 1 freq trample (5) - 2 freq staple (5) - 6 freq simplie (5) - 1 freq temple (5) - 86 freq servile (5) - 1 freq serial (5) - 3 freq shemale (5) - 1 freq maple (5) - 6 freq sempler (5) - 2 freq smale (5) - 1 freq surmise (6) - 3 freq templ (6) - 2 freq |
SoundEx code - S651 scornfu - 3 freq scramblin - 4 freq scornfully - 3 freq shrimp - 7 freq scrammbled - 1 freq srumphies - 1 freq scrimpit - 4 freq scramble - 6 freq scrimpie - 2 freq shairnbarely - 1 freq sermaple - 1 freq scramblit - 1 freq scourinburn - 1 freq scrambled - 7 freq scrimped - 1 freq scrannable - 2 freq scrimp - 6 freq scrumpin - 1 freq scrumptious-lukkan - 1 freq scrimpo - 1 freq scrumptious - 3 freq scramblan - 1 freq scrimplike - 1 freq scrumps - 1 freq sharonavirus - 1 freq screenplay - 2 freq scran-up - 1 freq shirenpolice - 1 freq serranoprod - 1 freq scramble - 1 freq screamofficial - 1 freq sharonwifey - 1 freq |
MetaPhone code - SRMPL sermaple - 1 freq |
SERMAPLE |
| Time to execute Levenshtein function - 0.194000 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.376186 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.028532 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.038274 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.000926 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. |