| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scrimped (0) - 1 freq scriped (1) - 1 freq scrimed (1) - 2 freq crimped (1) - 1 freq scriffed (2) - 1 freq scrieved (2) - 47 freq stripped (2) - 17 freq sclimmed (2) - 33 freq primped (2) - 3 freq scrimp (2) - 7 freq climped (2) - 1 freq scrived (2) - 3 freq striped (2) - 7 freq scrimpo (2) - 1 freq cramped (2) - 2 freq scraped (2) - 14 freq scrimpie (2) - 2 freq scrimpit (2) - 4 freq scrime (2) - 3 freq sclimbed (2) - 1 freq scripted (2) - 2 freq sclimed (2) - 2 freq stramped (2) - 8 freq scribed (2) - 1 freq crimmed (2) - 1 freq |
scrimped (0) - 1 freq scriped (2) - 1 freq crimped (2) - 1 freq scrimed (2) - 2 freq cramped (3) - 2 freq scraped (3) - 14 freq scrimpo (3) - 1 freq scrimpit (3) - 4 freq scrimpie (3) - 2 freq stramped (3) - 8 freq scrimp (3) - 7 freq scribed (4) - 1 freq scrumps (4) - 1 freq sclimed (4) - 2 freq crimmed (4) - 1 freq screamed (4) - 39 freq scrumpin (4) - 1 freq climped (4) - 1 freq scripted (4) - 2 freq scriffed (4) - 1 freq sclimbed (4) - 1 freq striped (4) - 7 freq scrived (4) - 3 freq primped (4) - 3 freq sclimmed (4) - 33 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 - SKRMPT scrimpit - 4 freq scrimped - 1 freq |
SCRIMPED |
| Time to execute Levenshtein function - 0.215116 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.439786 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.031997 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.037229 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.000892 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. |