| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scutterer (0) - 1 freq scutterin (2) - 11 freq scutters (2) - 1 freq shuttered (2) - 2 freq stuttered (2) - 1 freq scuttert (2) - 3 freq scattered (2) - 25 freq sputtered (2) - 1 freq scutter (2) - 13 freq spluttered (3) - 5 freq scattert (3) - 8 freq splutteren (3) - 3 freq smattered (3) - 3 freq cattered (3) - 2 freq skittered (3) - 10 freq cutter (3) - 5 freq stottered (3) - 3 freq stutter (3) - 4 freq scatter (3) - 14 freq slittered (3) - 3 freq muttered (3) - 40 freq shattered (3) - 23 freq scaittered (3) - 2 freq scuttled (3) - 8 freq stutterin (3) - 4 freq |
scutterer (0) - 1 freq scattered (3) - 25 freq scuttert (3) - 3 freq scutter (3) - 13 freq scutterin (3) - 11 freq scutters (3) - 1 freq scatterit (4) - 1 freq scatters (4) - 2 freq scatterin (4) - 3 freq scuttaran (4) - 1 freq scattert (4) - 8 freq shuttered (4) - 2 freq sputtered (4) - 1 freq scatter (4) - 14 freq stuttered (4) - 1 freq scaittered (4) - 2 freq scutcher (5) - 1 freq steerer (5) - 2 freq scottewen (5) - 1 freq shutter (5) - 2 freq squattered (5) - 1 freq stutters (5) - 1 freq sottered (5) - 1 freq scottories (5) - 21 freq scottr (5) - 2 freq |
SoundEx code - S366 steerer - 2 freq storrar - 1 freq storeruim - 1 freq storeroom - 3 freq steurer - 1 freq steerers - 1 freq stoorworm - 2 freq scutterer - 1 freq storer - 1 freq stirrer - 2 freq |
MetaPhone code - SKTRR scutterer - 1 freq |
SCUTTERER |
| Time to execute Levenshtein function - 0.559395 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 - 1.281089 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.104874 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.278609 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.000933 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. |