| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scaw-soused (0) - 1 freq calloused (4) - 2 freq snaw-dusted (4) - 1 freq scotsed (5) - 1 freq carousel (5) - 18 freq scarsome (5) - 1 freq acid-house (5) - 1 freq scansed (5) - 8 freq scouse (5) - 3 freq caressed (5) - 2 freq seasoned (5) - 7 freq scawed (5) - 1 freq scoured (5) - 5 freq scansouns (5) - 1 freq jalloused (5) - 1 freq aroused (5) - 1 freq scouser (5) - 2 freq sandsound (5) - 3 freq caused (5) - 78 freq smaw-scale (5) - 1 freq soused (5) - 2 freq jaloused (5) - 139 freq straw-stuffed (5) - 1 freq scandalised (5) - 2 freq savoured (5) - 4 freq |
scaw-soused (0) - 1 freq snaw-dusted (7) - 1 freq caressed (8) - 2 freq scandalised (8) - 2 freq smaw-scale (8) - 1 freq scansed (8) - 8 freq scawed (8) - 1 freq scotsed (8) - 1 freq calloused (8) - 2 freq accessed (9) - 2 freq classed (9) - 4 freq assessed (9) - 7 freq scairses (9) - 1 freq corssed (9) - 2 freq wissed (9) - 13 freq sussed (9) - 12 freq stressed (9) - 38 freq clossed (9) - 2 freq wussed (9) - 4 freq scotsedu (9) - 152 freq supressed (9) - 1 freq scuil-hoose (9) - 2 freq sunkissed (9) - 1 freq scowlded (9) - 1 freq sclunshed (9) - 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 - SKSST sexist - 6 freq sexiest - 4 freq scaw-soused - 1 freq zxst - 1 freq |
SCAW-SOUSED |
| Time to execute Levenshtein function - 0.607600 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.825975 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.075556 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.080331 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.000896 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. |