| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sortet (0) - 4 freq soartet (1) - 1 freq sorbet (1) - 2 freq sortit (1) - 51 freq sorten (1) - 2 freq sorted (1) - 79 freq snortet (1) - 1 freq fartet (2) - 2 freq sored (2) - 1 freq motet (2) - 3 freq spottet (2) - 4 freq forget (2) - 266 freq sortd (2) - 2 freq soften (2) - 2 freq dorset (2) - 2 freq snorted (2) - 7 freq sorta (2) - 6 freq sortir (2) - 1 freq softest (2) - 1 freq sorley (2) - 2 freq hornet (2) - 34 freq sort' (2) - 1 freq shorter (2) - 24 freq souter (2) - 9 freq worset (2) - 2 freq |
sortet (0) - 4 freq soartet (1) - 1 freq sortit (1) - 51 freq soartit (2) - 1 freq snortet (2) - 1 freq sertit (2) - 1 freq sorted (2) - 79 freq sorbet (2) - 2 freq sorten (2) - 2 freq snortit (3) - 16 freq sortin (3) - 24 freq suitet (3) - 3 freq sorti (3) - 2 freq fortiet (3) - 2 freq shoutet (3) - 54 freq serten (3) - 4 freq rootet (3) - 1 freq sortae (3) - 19 freq sorts (3) - 71 freq soarted (3) - 1 freq sortan (3) - 1 freq saltet (3) - 1 freq stertet (3) - 2 freq sort (3) - 310 freq stoatet (3) - 1 freq |
SoundEx code - S633 sortit - 51 freq soartit - 1 freq sorted - 79 freq surtout - 1 freq scartit - 23 freq skirtit - 3 freq serrated - 1 freq shrouded - 2 freq sortet - 4 freq shrood-white - 1 freq soarted - 1 freq skartit - 8 freq scrattit - 16 freq squirtit - 1 freq soartet - 1 freq shreddit - 2 freq squirted - 3 freq shrooded - 1 freq scarted - 1 freq shoarded - 1 freq scordet - 1 freq skirted - 2 freq short-o-time - 1 freq €˜sorted - 1 freq sertit - 1 freq shredded - 3 freq sjrthtuqlg - 1 freq |
MetaPhone code - SRTT sortit - 51 freq soartit - 1 freq sorted - 79 freq surtout - 1 freq serrated - 1 freq sortet - 4 freq soarted - 1 freq soartet - 1 freq €˜sorted - 1 freq sertit - 1 freq sortd - 2 freq |
SORTET |
| Time to execute Levenshtein function - 0.189151 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.337203 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.034711 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.037168 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.000946 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. |