| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suggestions (0) - 24 freq suggestion (1) - 25 freq suggestiouns (1) - 1 freq suggestin (2) - 13 freq suggesting (2) - 1 freq suggestin' (2) - 2 freq digestions (3) - 1 freq queestions (3) - 4 freq suggests (3) - 22 freq questions (3) - 193 freq suggestit (3) - 48 freq suggestan (3) - 1 freq suggestive (3) - 1 freq buggeration (4) - 1 freq question's (4) - 1 freq question (4) - 410 freq suggested (4) - 31 freq suggestet (4) - 1 freq staetions (4) - 4 freq digestion (4) - 1 freq sections (4) - 15 freq selections (4) - 1 freq questiont (4) - 1 freq qweestions (4) - 1 freq submissions (4) - 40 freq |
suggestions (0) - 24 freq suggestiouns (1) - 1 freq suggestion (2) - 25 freq suggestin' (3) - 2 freq suggesting (3) - 1 freq suggestin (3) - 13 freq suggestan (4) - 1 freq suggests (4) - 22 freq suggestive (5) - 1 freq suggestit (5) - 48 freq digestions (5) - 1 freq suggestet (6) - 1 freq questions (6) - 193 freq suggest (6) - 47 freq queestions (6) - 4 freq suggested (6) - 31 freq submeissions (7) - 3 freq surgeons (7) - 4 freq questiouns (7) - 1 freq quistions (7) - 1 freq questiones (7) - 1 freq sujjesjins (7) - 1 freq singletons (7) - 2 freq assignations (7) - 1 freq questins (7) - 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 - SKSXNS suggestions - 24 freq suggestiouns - 1 freq |
SUGGESTIONS |
| Time to execute Levenshtein function - 0.232959 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.376521 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.028643 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.038889 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.001004 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. |