Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
scrumptious (0) - 3 freq casumptious (3) - 1 freq sumptuous (3) - 1 freq gumptious (3) - 1 freq scrumpin (4) - 1 freq srumphies (4) - 1 freq trumpties (4) - 1 freq assumptions (4) - 6 freq cautious (4) - 8 freq scrious (4) - 1 freq carnaptious (4) - 44 freq volumptuous (4) - 1 freq scrumps (4) - 1 freq scriptirs (4) - 6 freq sculptors (4) - 1 freq scruntie's (4) - 1 freq acrimonious (4) - 1 freq dscriptions (4) - 1 freq eruptions (4) - 2 freq scrutiny (5) - 5 freq voluptuous (5) - 1 freq unscrupulous (5) - 2 freq captioun (5) - 1 freq curious (5) - 75 freq symphioun (5) - 1 freq |
scrumptious (0) - 3 freq scrumps (5) - 1 freq casumptious (5) - 1 freq sumptuous (5) - 1 freq carnaptious (6) - 44 freq scrimpit (6) - 4 freq crumpets (6) - 1 freq scriptirs (6) - 6 freq scripts (6) - 3 freq scrumpin (6) - 1 freq srumphies (6) - 1 freq trumpties (6) - 1 freq gumptious (6) - 1 freq scrimplike (7) - 1 freq crumples (7) - 1 freq scrums (7) - 1 freq scrimpie (7) - 2 freq scorpions (7) - 3 freq scriptir (7) - 4 freq scriptvs (7) - 1 freq scripters (7) - 4 freq scriptur (7) - 2 freq scripturs (7) - 4 freq scrapins (7) - 3 freq strumps (7) - 1 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 - SKRMPXS scrumptious - 3 freq |
SCRUMPTIOUS |
Time to execute Levenshtein function - 0.269046 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.512772 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.031174 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.042894 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.000961 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. |