| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| schiftit (0) - 1 freq scriftit (1) - 2 freq shiftit (1) - 33 freq chistit (2) - 2 freq siftit (2) - 1 freq scriftin (2) - 4 freq chirtit (2) - 1 freq shiftie (2) - 1 freq hiftit (2) - 1 freq shiftin (2) - 33 freq scriptit (2) - 1 freq shootit (3) - 1 freq scifi (3) - 1 freq sprittit (3) - 1 freq suitit (3) - 8 freq sciatic (3) - 1 freq salistit (3) - 2 freq shuitit (3) - 4 freq skirtit (3) - 3 freq driftit (3) - 9 freq shifts (3) - 38 freq iftit (3) - 1 freq shiftied (3) - 1 freq chidit (3) - 2 freq spittit (3) - 2 freq |
schiftit (0) - 1 freq scriftit (2) - 2 freq shiftit (2) - 33 freq scriptit (4) - 1 freq sichtit (4) - 7 freq shiftin (4) - 33 freq sechtit (4) - 3 freq hiftit (4) - 1 freq chistit (4) - 2 freq siftit (4) - 1 freq scriftin (4) - 4 freq shiftie (4) - 1 freq chirtit (4) - 1 freq scuttit (5) - 2 freq scruntit (5) - 2 freq shifter (5) - 1 freq shiftan (5) - 4 freq scrattit (5) - 16 freq chaffit (5) - 1 freq sclatit (5) - 1 freq heftit (5) - 5 freq scootit (5) - 3 freq chuffit (5) - 2 freq cheatit (5) - 3 freq craftit (5) - 3 freq |
SoundEx code - S133 spottit - 24 freq shiftit - 33 freq subdued - 5 freq schiftit - 1 freq spotted - 41 freq shifted - 18 freq spooted - 1 freq sappie-heidit - 4 freq sifted - 1 freq spottet - 4 freq speeded - 2 freq saft-white - 1 freq spoated - 1 freq shafted - 7 freq spoatted - 1 freq 'spat-the-dummy - 1 freq spittit - 2 freq shiftied - 1 freq sub-title - 1 freq speedit - 6 freq scabby-heidit - 1 freq scabbie-heidit - 1 freq subteetle - 1 freq saft-heidit - 1 freq siftit - 1 freq subdit - 1 freq sub-titles - 1 freq subtitled - 3 freq subtitling - 1 freq subtitles - 4 freq 'shafted - 1 freq spouted - 1 freq shuftie-watchin - 1 freq |
MetaPhone code - SXFTT schiftit - 1 freq |
SCHIFTIT |
| Time to execute Levenshtein function - 0.227629 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.366591 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.032778 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.038061 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.001015 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. |