| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scrimpie (0) - 2 freq scrimpit (1) - 4 freq scrimplike (2) - 1 freq scrime (2) - 3 freq scrimp (2) - 7 freq scrimped (2) - 1 freq scrimpo (2) - 1 freq scrumpin (2) - 1 freq scrimin (2) - 2 freq screichie (3) - 3 freq chippie (3) - 10 freq strampit (3) - 2 freq scrim (3) - 1 freq skyimpit (3) - 1 freq clippie (3) - 2 freq simwie (3) - 1 freq scramble (3) - 6 freq scraipin (3) - 1 freq 'crime (3) - 1 freq shippie (3) - 1 freq skrinkie (3) - 1 freq scringin (3) - 1 freq scriftit (3) - 2 freq scrive (3) - 1 freq grumpie (3) - 1 freq |
scrimpie (0) - 2 freq scrimp (2) - 7 freq scrimpo (2) - 1 freq scrimpit (2) - 4 freq scrime (3) - 3 freq scrumpin (3) - 1 freq scrimin (3) - 2 freq scrimped (3) - 1 freq scrip (4) - 3 freq shrimp (4) - 7 freq scampi (4) - 1 freq crimp (4) - 1 freq scrimed (4) - 2 freq scrumps (4) - 1 freq scrape (4) - 30 freq scrimplike (4) - 1 freq scrim (4) - 1 freq scrieve (5) - 168 freq screamit (5) - 2 freq scribe (5) - 7 freq scrievin (5) - 163 freq schemie (5) - 2 freq strampit (5) - 2 freq creepie (5) - 9 freq scrammle (5) - 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 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 |
SCRIMPIE |
| Time to execute Levenshtein function - 0.263411 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.586239 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.027079 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.085935 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.000906 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. |