Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
squintit (0) - 8 freq squirtit (1) - 1 freq squintin (1) - 6 freq sprintit (2) - 4 freq sauntit (2) - 9 freq suitit (2) - 8 freq squint (2) - 13 freq shuitit (2) - 4 freq stuntit (2) - 1 freq quintin (2) - 1 freq stintit (2) - 2 freq squinty (2) - 6 freq shuntit (2) - 2 freq splintit (2) - 1 freq squattit (2) - 1 freq sintit (2) - 3 freq squinted (2) - 2 freq squints (2) - 1 freq squirtin (2) - 3 freq sunti (3) - 9 freq bruitit (3) - 1 freq squawkit (3) - 1 freq spittit (3) - 2 freq printit (3) - 8 freq squirmin (3) - 3 freq |
squintit (0) - 8 freq squintin (2) - 6 freq squirtit (2) - 1 freq squattit (3) - 1 freq shuntit (3) - 2 freq sintit (3) - 3 freq squints (3) - 1 freq stintit (3) - 2 freq squinted (3) - 2 freq squinty (3) - 6 freq stuntit (3) - 1 freq sauntit (3) - 9 freq squint (3) - 13 freq spentit (4) - 1 freq slantit (4) - 4 freq santit (4) - 2 freq saantit (4) - 1 freq quantity (4) - 8 freq scentit (4) - 2 freq stentit (4) - 9 freq acquentit (4) - 2 freq scantit (4) - 1 freq sqint (4) - 1 freq squirtin (4) - 3 freq quintin (4) - 1 freq |
SoundEx code - S533 soondit - 61 freq soundit - 29 freq soonded - 23 freq squinted - 2 freq sounded - 25 freq smoothed - 3 freq sneddit - 11 freq squintit - 8 freq sauntit - 9 freq synthetic - 8 freq shuntit - 2 freq smeethed - 4 freq skin-taut - 1 freq scented - 3 freq soundet - 12 freq sanitation - 4 freq sumdy'd - 3 freq smootit - 2 freq syndit - 1 freq saantit - 1 freq smitit - 1 freq scentit - 2 freq semi-detached - 5 freq scantit - 1 freq santit - 2 freq sintit - 3 freq smooted - 1 freq smittit - 1 freq sendit - 1 freq €˜synthetic - 1 freq 'synthetic' - 1 freq syntatical - 1 freq smitted - 1 freq sundaydilemma - 1 freq smdit - 1 freq |
MetaPhone code - SKNTT squinted - 2 freq squintit - 8 freq skin-taut - 1 freq scantit - 1 freq seconded - 1 freq |
SQUINTIT |
Time to execute Levenshtein function - 0.240007 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.374330 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.027371 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.045102 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.001133 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. |