| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suggested (0) - 31 freq suggestet (1) - 1 freq suggestin (2) - 13 freq suggestan (2) - 1 freq suggestit (2) - 48 freq suggest (2) - 47 freq suggests (2) - 22 freq egested (3) - 1 freq suggesting (3) - 1 freq supressed (3) - 1 freq buggered (3) - 13 freq suggestive (3) - 1 freq subjected (3) - 4 freq digested (3) - 5 freq suggestion (3) - 25 freq shaested (3) - 1 freq suspected (3) - 7 freq budgeted (3) - 1 freq ingested (3) - 3 freq suggestin' (3) - 2 freq submitted (4) - 5 freq surmised (4) - 3 freq protested (4) - 9 freq gresped (4) - 1 freq lugged (4) - 5 freq |
suggested (0) - 31 freq suggestet (2) - 1 freq suggests (3) - 22 freq suggestit (3) - 48 freq suggest (3) - 47 freq suggestin (3) - 13 freq suggestan (3) - 1 freq suggestive (4) - 1 freq suggestion (4) - 25 freq suggestin' (5) - 2 freq digested (5) - 5 freq shaested (5) - 1 freq ingested (5) - 3 freq egested (5) - 1 freq suggesting (5) - 1 freq subjected (6) - 4 freq disgusted (6) - 4 freq sighted (6) - 2 freq suggestions (6) - 24 freq sagged (6) - 1 freq sangster (6) - 24 freq biggest (6) - 141 freq suspected (6) - 7 freq supressed (6) - 1 freq budgeted (6) - 1 freq |
SoundEx code - S223 suggestit - 48 freq suggests - 22 freq suggest - 47 freq suggested - 31 freq suggestion - 25 freq suggestin' - 2 freq sea-gust - 1 freq sexist - 6 freq suggestin - 13 freq suggestive - 1 freq suggestions - 24 freq sexiest - 4 freq suggestet - 1 freq swackest - 2 freq sie-kist - 2 freq sickest - 1 freq shokkict - 1 freq scaw-soused - 1 freq sociohistorical - 1 freq sequestra - 1 freq sequestration - 1 freq sequestratioune - 1 freq suggestiouns - 1 freq sequestered - 1 freq suggestan - 1 freq suggesting - 1 freq swcoastal - 1 freq |
MetaPhone code - SKSTT suggestit - 48 freq suggested - 31 freq succeedit - 6 freq succeeded - 8 freq suggestet - 1 freq sixtiet - 1 freq |
SUGGESTED |
| Time to execute Levenshtein function - 0.230306 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.369148 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.027849 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.037499 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.000882 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. |