| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isit (0) - 1 freq isis (1) - 1 freq is't (1) - 48 freq ist (1) - 11 freq i-it (1) - 1 freq risit (1) - 1 freq 'sit (1) - 7 freq usit (1) - 4 freq isie (1) - 79 freq visit (1) - 146 freq isnt (1) - 2 freq init (1) - 1 freq uisit (1) - 7 freq issit (1) - 1 freq sit (1) - 642 freq leit (2) - 15 freq ight (2) - 1 freq innit (2) - 10 freq situ (2) - 2 freq raisit (2) - 15 freq askit (2) - 133 freq isitok (2) - 1 freq irt (2) - 3 freq 'bit (2) - 24 freq skit (2) - 3 freq |
isit (0) - 1 freq sit (1) - 642 freq uisit (1) - 7 freq ist (1) - 11 freq usit (1) - 4 freq seit (2) - 1 freq yaisit (2) - 4 freq iste (2) - 1 freq yset (2) - 2 freq set (2) - 1501 freq syit (2) - 1 freq st (2) - 378 freq est (2) - 22 freq sut (2) - 161 freq ast (2) - 8 freq sot (2) - 6 freq suit (2) - 159 freq sat (2) - 740 freq site (2) - 100 freq soit (2) - 1 freq aist (2) - 21 freq visit (2) - 146 freq init (2) - 1 freq issit (2) - 1 freq syt (2) - 1 freq |
SoundEx code - I230 iced - 14 freq izzat - 2 freq is-'the - 1 freq ight - 1 freq is't - 48 freq 'is't - 1 freq iste - 1 freq i-ight - 1 freq ist - 11 freq iiokket - 1 freq iikit - 1 freq izat - 1 freq issued - 6 freq is-the - 1 freq ict - 1 freq i'stew - 1 freq i'cat - 1 freq i'settee - 1 freq i'shade - 5 freq iside - 1 freq izatt - 2 freq ischewed - 1 freq €™ist - 2 freq isit - 1 freq issit - 1 freq izzata - 1 freq ixd - 1 freq izt - 1 freq isd - 1 freq iogjkota - 1 freq iscot - 1 freq isaidaye - 2 freq ikcd - 1 freq |
MetaPhone code - IST iced - 14 freq izzat - 2 freq is't - 48 freq 'is't - 1 freq iste - 1 freq ist - 11 freq izat - 1 freq issued - 6 freq i'stew - 1 freq i'settee - 1 freq iside - 1 freq izatt - 2 freq €™ist - 2 freq isit - 1 freq issit - 1 freq izzata - 1 freq izt - 1 freq isd - 1 freq |
ISIT |
| Time to execute Levenshtein function - 0.470283 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.706954 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.028012 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.037530 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.000810 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. |