| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scrattit (0) - 16 freq scrattin (1) - 10 freq scrartit (1) - 1 freq scantit (2) - 1 freq sattit (2) - 1 freq scraggit (2) - 1 freq scratcht (2) - 1 freq sclatit (2) - 1 freq scruntit (2) - 2 freq scuttit (2) - 2 freq scratty (2) - 4 freq scrapit (2) - 10 freq struttit (2) - 1 freq chattit (2) - 1 freq swattit (2) - 2 freq scrittin (2) - 1 freq scratchit (2) - 1 freq scratten (2) - 1 freq craftit (2) - 3 freq scriftit (2) - 2 freq sprittit (2) - 1 freq scartit (2) - 23 freq squattit (2) - 1 freq skrattin (2) - 1 freq scrattins (2) - 1 freq |
scrattit (0) - 16 freq scrartit (2) - 1 freq scrattin (2) - 10 freq scrittin (3) - 1 freq struttit (3) - 1 freq scratten (3) - 1 freq scartit (3) - 23 freq scratty (3) - 4 freq sprittit (3) - 1 freq scriftit (3) - 2 freq scriptit (3) - 1 freq scuttit (3) - 2 freq scruntit (3) - 2 freq squattit (4) - 1 freq sattit (4) - 1 freq skrattin (4) - 1 freq scantit (4) - 1 freq scottyt (4) - 1 freq scraggit (4) - 1 freq scrapit (4) - 10 freq scrattins (4) - 1 freq swattit (4) - 2 freq chattit (4) - 1 freq scratcht (4) - 1 freq scratchit (4) - 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 - SKRTT scartit - 23 freq skirtit - 3 freq skartit - 8 freq scrattit - 16 freq squirtit - 1 freq squirted - 3 freq scarted - 1 freq scordet - 1 freq skirted - 2 freq secreted - 1 freq |
SCRATTIT |
| Time to execute Levenshtein function - 0.305948 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.539360 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.059226 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.037714 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.000949 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. |