| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suggests (0) - 21 freq suggest (1) - 46 freq suggestin (2) - 13 freq suggestit (2) - 48 freq suggested (2) - 28 freq suggestan (2) - 1 freq nuggets (2) - 6 freq suggestet (2) - 1 freq subverts (3) - 1 freq suggesting (3) - 1 freq gests (3) - 2 freq suggestin' (3) - 2 freq subjects (3) - 36 freq buggert (3) - 3 freq success (3) - 96 freq suggestion (3) - 25 freq surest (3) - 1 freq suggestive (3) - 1 freq puggelt (3) - 2 freq hughesms (3) - 1 freq sunkets (3) - 2 freq sungaets (3) - 1 freq surfeits (3) - 1 freq budgets (3) - 6 freq suspects (3) - 4 freq |
suggests (0) - 21 freq suggest (2) - 46 freq suggestan (3) - 1 freq suggested (3) - 28 freq suggestet (3) - 1 freq suggestin (3) - 13 freq suggestit (3) - 48 freq suggestive (4) - 1 freq suggestions (4) - 24 freq suggestion (4) - 25 freq nuggets (4) - 6 freq huggsss (5) - 1 freq secrests (5) - 1 freq signets (5) - 1 freq segments (5) - 2 freq sunsets (5) - 4 freq guests (5) - 46 freq biggest (5) - 137 freq suggestiouns (5) - 1 freq huggises (5) - 1 freq svgeesus (5) - 1 freq sodgets (5) - 1 freq suggesting (5) - 1 freq gests (5) - 2 freq sungaets (5) - 1 freq |
SoundEx code - S223 suggestit - 48 freq suggests - 21 freq suggest - 46 freq suggested - 28 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 - SKSTS suggests - 21 freq saxties - 4 freq sixties - 13 freq 'sax-days - 1 freq succeeds - 1 freq |
SUGGESTS |
| Time to execute Levenshtein function - 0.240553 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.444718 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.027230 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.037590 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.000793 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. |