| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scrimpit (0) - 4 freq scrimpie (1) - 2 freq crampit (2) - 2 freq primpit (2) - 1 freq script (2) - 30 freq scrimin (2) - 2 freq scriptit (2) - 1 freq skyimpit (2) - 1 freq scrapit (2) - 10 freq scrimpo (2) - 1 freq scrimped (2) - 1 freq scrimp (2) - 7 freq scrievit (2) - 104 freq strippit (2) - 34 freq strampit (2) - 2 freq scrumpin (2) - 1 freq scriftit (2) - 2 freq airmpit (3) - 1 freq cribbit (3) - 1 freq scraepin (3) - 1 freq jimpit (3) - 5 freq screamit (3) - 2 freq scrammlit (3) - 1 freq schippis (3) - 1 freq scribin (3) - 3 freq |
scrimpit (0) - 4 freq scrimpie (2) - 2 freq scrimpo (3) - 1 freq scrimped (3) - 1 freq scrumpin (3) - 1 freq scrapit (3) - 10 freq scrimp (3) - 7 freq strampit (3) - 2 freq script (3) - 30 freq crampit (3) - 2 freq scrimin (4) - 2 freq skyimpit (4) - 1 freq screamit (4) - 2 freq scraipet (4) - 2 freq crumpet (4) - 1 freq scriftit (4) - 2 freq scrumps (4) - 1 freq scrievit (4) - 104 freq strippit (4) - 34 freq scriptit (4) - 1 freq scrappet (4) - 1 freq primpit (4) - 1 freq scraggit (5) - 1 freq scrime (5) - 3 freq champit (5) - 11 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 |
SCRIMPIT |
| Time to execute Levenshtein function - 0.440762 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.694041 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.087117 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.162941 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.001222 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. |