| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| littlins (0) - 25 freq kittlins (1) - 5 freq littlin's (1) - 2 freq littlin (1) - 17 freq littleins (1) - 1 freq littlans (1) - 2 freq kitlins (2) - 6 freq listins (2) - 1 freq lichtlins (2) - 1 freq tittlin (2) - 1 freq wittins (2) - 224 freq fittins (2) - 1 freq kittlin's (2) - 2 freq kittlins' (2) - 1 freq €œlittlins (2) - 1 freq kittlin (2) - 59 freq aistlins (2) - 1 freq flittins (2) - 3 freq kittling (2) - 4 freq littin (2) - 10 freq ettlins (2) - 23 freq fistlins (2) - 1 freq kettlin (3) - 3 freq littie (3) - 1 freq flatlins (3) - 2 freq |
littlins (0) - 25 freq littlans (1) - 2 freq littleins (1) - 1 freq littlin (2) - 17 freq kittlins (2) - 5 freq littlin's (2) - 2 freq ettlins (3) - 23 freq littin (4) - 10 freq flittins (4) - 3 freq kittling (4) - 4 freq lyttle's (4) - 2 freq kittlin (4) - 59 freq littleens' (4) - 1 freq fistlins (4) - 1 freq aistlins (4) - 1 freq lichtlins (4) - 1 freq €œlittlins (4) - 1 freq kitlins (4) - 6 freq listins (4) - 1 freq wittins (4) - 224 freq tittlin (4) - 1 freq kittlins' (4) - 1 freq kittlin's (4) - 2 freq fittins (4) - 1 freq pattrins (5) - 1 freq |
SoundEx code - L345 laithliness - 1 freq littlin - 17 freq laidlin - 1 freq littlins - 25 freq littleins - 1 freq littleens' - 1 freq €œlittlins - 1 freq leddylanners - 2 freq littlin's - 2 freq littlans - 2 freq leddylanner - 1 freq ladelin - 1 freq littlenaughty - 1 freq littlemusic - 4 freq littlemore - 2 freq ladylyonglencoe - 11 freq |
MetaPhone code - LTLNS littlins - 25 freq littleins - 1 freq littleens' - 1 freq €œlittlins - 1 freq littlin's - 2 freq littlans - 2 freq |
LITTLINS |
| Time to execute Levenshtein function - 0.343860 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.562639 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.039575 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.042502 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.000860 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. |