| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scrimp (0) - 7 freq scrimpo (1) - 1 freq scrim (1) - 1 freq crimp (1) - 1 freq shrimp (1) - 7 freq scrip (1) - 3 freq scrime (1) - 3 freq scrum (2) - 2 freq scrumps (2) - 1 freq sclims (2) - 10 freq crime (2) - 70 freq scrimin (2) - 2 freq scrimpit (2) - 4 freq scrift (2) - 2 freq crump (2) - 1 freq schip (2) - 1 freq scries (2) - 1 freq scribe (2) - 7 freq scraip (2) - 1 freq scraep (2) - 1 freq stimp (2) - 1 freq crisp (2) - 43 freq sclimb (2) - 1 freq sclim (2) - 25 freq chimp (2) - 3 freq |
scrimp (0) - 7 freq scrimpo (1) - 1 freq scrime (2) - 3 freq scrimpie (2) - 2 freq scrip (2) - 3 freq scrim (2) - 1 freq shrimp (2) - 7 freq crimp (2) - 1 freq scrap (3) - 33 freq scraep (3) - 1 freq scrimped (3) - 1 freq scrums (3) - 1 freq scram (3) - 1 freq cramp (3) - 4 freq stramp (3) - 11 freq scrimed (3) - 2 freq scraip (3) - 1 freq scrimin (3) - 2 freq crump (3) - 1 freq scrimpit (3) - 4 freq scrumps (3) - 1 freq scrum (3) - 2 freq sclimt (4) - 9 freq scrumpin (4) - 1 freq scrit (4) - 6 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 scrimp - 7 freq scramblit - 1 freq scourinburn - 1 freq scrambled - 7 freq scrimped - 1 freq scrannable - 2 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 - SKRMP scrimpie - 2 freq scrimp - 7 freq scrimpo - 1 freq |
SCRIMP |
| Time to execute Levenshtein function - 0.178237 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.346006 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.027731 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.037251 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.000923 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. |