| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skirtit (0) - 3 freq skartit (1) - 8 freq snirtit (1) - 2 freq skitit (1) - 15 freq skirlit (1) - 1 freq skirtin (1) - 12 freq skirlin (2) - 48 freq flirtit (2) - 1 freq sertit (2) - 1 freq sintit (2) - 3 freq squirtit (2) - 1 freq suitit (2) - 8 freq sortit (2) - 51 freq spurtit (2) - 1 freq skitie (2) - 4 freq skyrit (2) - 1 freq skiltin (2) - 1 freq skirrin (2) - 2 freq smittit (2) - 1 freq spittit (2) - 2 freq shirpit (2) - 2 freq dairtit (2) - 1 freq skartin (2) - 4 freq sirit (2) - 1 freq snortit (2) - 16 freq |
skirtit (0) - 3 freq skartit (1) - 8 freq skirlit (2) - 1 freq skirtin (2) - 12 freq skitit (2) - 15 freq snirtit (2) - 2 freq stertit (3) - 476 freq skoitit (3) - 1 freq soartit (3) - 1 freq skartin (3) - 4 freq skirts (3) - 26 freq stairtit (3) - 303 freq skytit (3) - 9 freq spiritit (3) - 1 freq snortit (3) - 16 freq skirlt (3) - 1 freq spurtit (3) - 1 freq spartit (3) - 2 freq sertit (3) - 1 freq skirt (3) - 56 freq skirted (3) - 2 freq squirtit (3) - 1 freq startit (3) - 157 freq skyrit (3) - 1 freq scartit (3) - 23 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 |
SKIRTIT |
| Time to execute Levenshtein function - 0.280737 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.388822 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.030436 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.042287 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.000974 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. |