Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
squirtit (0) - 1 freq squirtin (1) - 4 freq squintit (1) - 8 freq squintin (2) - 7 freq squirted (2) - 3 freq stairtit (2) - 303 freq suitit (2) - 8 freq steirtit (2) - 1 freq squirmin (2) - 3 freq squirts (2) - 1 freq squirmt (2) - 1 freq skirtit (2) - 3 freq squattit (2) - 1 freq snirtit (2) - 2 freq squirt (2) - 4 freq shuitit (2) - 4 freq smuirit (2) - 3 freq spurtit (2) - 1 freq staitit (3) - 1 freq spittit (3) - 2 freq smitit (3) - 1 freq spurtin (3) - 2 freq startit (3) - 157 freq dairtit (3) - 1 freq spiritit (3) - 1 freq |
squirtit (0) - 1 freq squintit (2) - 8 freq squirtin (2) - 4 freq skirtit (3) - 3 freq squirmt (3) - 1 freq squirt (3) - 4 freq spurtit (3) - 1 freq squirts (3) - 1 freq snirtit (3) - 2 freq squattit (3) - 1 freq stairtit (3) - 303 freq squirted (3) - 3 freq steirtit (3) - 1 freq soartit (4) - 1 freq speertit (4) - 1 freq spartit (4) - 2 freq snortit (4) - 16 freq stairtet (4) - 92 freq quartet (4) - 2 freq sertit (4) - 1 freq scartit (4) - 23 freq skartit (4) - 8 freq sortit (4) - 51 freq stertit (4) - 476 freq speiritit (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 |
SQUIRTIT |
Time to execute Levenshtein function - 0.262132 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.485096 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.029467 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.044121 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.000980 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. |