| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| listit (0) - 7 freq lastit (1) - 13 freq histit (1) - 1 freq laistit (1) - 2 freq mistit (1) - 1 freq lestit (1) - 11 freq kistit (1) - 6 freq liltit (1) - 2 freq listet (1) - 1 freq ristit (1) - 5 freq luistit (1) - 1 freq liftit (1) - 134 freq listin (1) - 4 freq flistit (1) - 1 freq listent (2) - 10 freq dustit (2) - 5 freq listnin (2) - 5 freq liftid (2) - 1 freq vestit (2) - 1 freq loutit (2) - 3 freq livit (2) - 1 freq lister (2) - 6 freq listenit (2) - 1 freq fistir (2) - 1 freq lists (2) - 19 freq |
listit (0) - 7 freq listet (1) - 1 freq lestit (1) - 11 freq luistit (1) - 1 freq laistit (1) - 2 freq lastit (1) - 13 freq mistit (2) - 1 freq flistit (2) - 1 freq liftit (2) - 134 freq listin (2) - 4 freq kistit (2) - 6 freq histit (2) - 1 freq liltit (2) - 2 freq ristit (2) - 5 freq hoistit (3) - 1 freq luftit (3) - 7 freq waistit (3) - 4 freq hostit (3) - 7 freq leetit (3) - 6 freq jestit (3) - 1 freq ruistit (3) - 1 freq rostit (3) - 1 freq lestin (3) - 2 freq lantit (3) - 1 freq postit (3) - 13 freq |
SoundEx code - L233 lichtit - 64 freq lestit - 11 freq lasted - 15 freq lichted - 14 freq licht-heided - 1 freq least-at - 3 freq lastit - 13 freq lassitude - 1 freq licht-heidit - 4 freq listed - 6 freq luistit - 1 freq lichtet - 2 freq 'lichtet - 1 freq located - 5 freq lighted - 3 freq listet - 1 freq liquidation - 2 freq laistit - 2 freq lactatin - 1 freq lested - 4 freq locatit - 7 freq listit - 7 freq lightit - 1 freq laisted - 3 freq €˜last-ditch - 1 freq liquidate - 2 freq light-headed - 1 freq lichtheidit - 1 freq lucky-white-heather - 1 freq last-ditch - 1 freq liquidated - 1 freq 'lactate' - 1 freq looktothesea - 1 freq |
MetaPhone code - LSTT lestit - 11 freq lasted - 15 freq least-at - 3 freq lastit - 13 freq lassitude - 1 freq listed - 6 freq luistit - 1 freq listet - 1 freq laistit - 2 freq lested - 4 freq listit - 7 freq laisted - 3 freq |
LISTIT |
| Time to execute Levenshtein function - 0.207887 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.341054 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.029101 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.041015 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.000862 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. |