| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lastit (0) - 13 freq wastit (1) - 21 freq blastit (1) - 9 freq castit (1) - 1 freq pastit (1) - 1 freq laistit (1) - 2 freq lastin (1) - 9 freq lantit (1) - 1 freq lestit (1) - 11 freq listit (1) - 7 freq tastit (1) - 29 freq boastit (2) - 1 freq claspit (2) - 4 freq restit (2) - 18 freq castin (2) - 48 freq vestit (2) - 1 freq clartit (2) - 15 freq latin (2) - 92 freq lustie (2) - 1 freq warstit (2) - 1 freq laedit (2) - 1 freq lestie (2) - 1 freq last' (2) - 1 freq saatit (2) - 1 freq tastit- (2) - 1 freq |
lastit (0) - 13 freq lestit (1) - 11 freq laistit (1) - 2 freq listit (1) - 7 freq tastit (2) - 29 freq pastit (2) - 1 freq luistit (2) - 1 freq wastit (2) - 21 freq blastit (2) - 9 freq castit (2) - 1 freq lastin (2) - 9 freq lantit (2) - 1 freq listet (2) - 1 freq toastit (3) - 5 freq loutit (3) - 3 freq lesmit (3) - 1 freq dustit (3) - 5 freq listin (3) - 4 freq taistit (3) - 1 freq bustit (3) - 2 freq leetit (3) - 6 freq tastet (3) - 1 freq waistit (3) - 4 freq sautit (3) - 2 freq lastly (3) - 5 freq |
SoundEx code - L233 lichtit - 64 freq lestit - 11 freq lasted - 16 freq lichted - 14 freq licht-heided - 1 freq least-at - 3 freq lastit - 13 freq lassitude - 1 freq licht-heidit - 4 freq listed - 7 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 - 16 freq least-at - 3 freq lastit - 13 freq lassitude - 1 freq listed - 7 freq luistit - 1 freq listet - 1 freq laistit - 2 freq lested - 4 freq listit - 7 freq laisted - 3 freq |
LASTIT |
| Time to execute Levenshtein function - 0.230280 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.338656 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.027336 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.037392 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.000931 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. |