| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skartit (0) - 8 freq startit (1) - 157 freq scartit (1) - 23 freq spartit (1) - 2 freq soartit (1) - 1 freq skirtit (1) - 3 freq skartin (1) - 4 freq stertit (2) - 476 freq starvit (2) - 1 freq sautit (2) - 2 freq starlit (2) - 1 freq skitit (2) - 15 freq saantit (2) - 1 freq startet (2) - 150 freq staurtit (2) - 1 freq soartet (2) - 1 freq scantit (2) - 1 freq sartin (2) - 6 freq stairtit (2) - 303 freq skirtin (2) - 12 freq saatit (2) - 1 freq skrit (2) - 6 freq seartin (2) - 1 freq startid (2) - 2 freq slantit (2) - 4 freq |
skartit (0) - 8 freq skirtit (1) - 3 freq startit (2) - 157 freq scartit (2) - 23 freq skartin (2) - 4 freq spartit (2) - 2 freq soartit (2) - 1 freq spurtit (3) - 1 freq skirlit (3) - 1 freq skrit (3) - 6 freq snortit (3) - 16 freq sertit (3) - 1 freq sortit (3) - 51 freq snirtit (3) - 2 freq skirtin (3) - 12 freq skytit (3) - 9 freq skoitit (3) - 1 freq skarts (3) - 3 freq stairtit (3) - 303 freq skyrit (3) - 1 freq skitit (3) - 15 freq startt (3) - 1 freq stertit (3) - 476 freq staurtit (3) - 1 freq startet (3) - 150 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 |
SKARTIT |
| Time to execute Levenshtein function - 0.246967 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.409931 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.031011 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.039179 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.001001 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. |