| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sassermaet (0) - 6 freq saucermeat (4) - 1 freq casserole (4) - 3 freq asserted (4) - 1 freq assuret (4) - 4 freq sassenger (4) - 1 freq saiterdae (4) - 1 freq casseroled (4) - 1 freq assumet (4) - 1 freq sasser (4) - 11 freq exasserbait (4) - 1 freq assemblet (4) - 1 freq sassenach (4) - 9 freq assembelt (4) - 1 freq assert (4) - 7 freq gesserant (4) - 1 freq sassers (4) - 6 freq assertit (4) - 2 freq sherbet (5) - 7 freq stertlet (5) - 1 freq bobservant (5) - 1 freq wasser (5) - 1 freq masseev (5) - 1 freq bannerman (5) - 1 freq sherman (5) - 1 freq |
sassermaet (0) - 6 freq assert (6) - 7 freq sasser (6) - 11 freq gesserant (6) - 1 freq sassers (6) - 6 freq assertit (6) - 2 freq assumet (6) - 1 freq exasserbait (6) - 1 freq assuret (6) - 4 freq saucermeat (6) - 1 freq dessert (7) - 4 freq assurt (7) - 1 freq assistant (7) - 19 freq reassuret (7) - 2 freq assessment (7) - 23 freq asseirt (7) - 1 freq asseert (7) - 1 freq assumt (7) - 1 freq assessit (7) - 1 freq susset (7) - 1 freq desseruit (7) - 1 freq squeermt (7) - 2 freq assortit (7) - 3 freq assemblet (7) - 1 freq sassenach (7) - 9 freq |
SoundEx code - S265 siccarness - 5 freq sacraments - 1 freq saccharin - 1 freq sacrament - 7 freq swagerrin - 1 freq swiss-german - 1 freq sojourn - 1 freq swaggerin - 5 freq sassermaet - 6 freq saucermeat - 1 freq sixareens - 2 freq sixern - 3 freq sixerns - 1 freq sixareen - 1 freq securin - 1 freq sacrum - 1 freq sea-green - 1 freq shawgroonds - 1 freq sigzsyrmce - 1 freq |
MetaPhone code - SSRMT sassermaet - 6 freq saucermeat - 1 freq |
SASSERMAET |
| Time to execute Levenshtein function - 0.216894 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.374447 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.029733 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.038034 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.000877 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. |