| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| littlemore (0) - 2 freq kittlesome (3) - 8 freq littlelou (3) - 1 freq lettermore (3) - 1 freq little-wee (3) - 5 freq littler (3) - 1 freq little-' (4) - 3 freq litter (4) - 16 freq mettlesome (4) - 2 freq toremore (4) - 1 freq littleins (4) - 1 freq litesome (4) - 1 freq littleens' (4) - 1 freq lithesome (4) - 1 freq little (4) - 408 freq little-read (4) - 1 freq littered (4) - 9 freq littlemusic (4) - 4 freq blithesome (5) - 3 freq hitler (5) - 10 freq implore (5) - 1 freq nitter (5) - 1 freq latterlie (5) - 2 freq titter (5) - 1 freq listener (5) - 5 freq |
littlemore (0) - 2 freq littler (4) - 1 freq lettermore (4) - 1 freq littlelou (5) - 1 freq little-wee (5) - 5 freq littlemusic (6) - 4 freq little-read (6) - 1 freq littleins (6) - 1 freq little-' (6) - 3 freq kittlesome (6) - 8 freq little (6) - 408 freq litter (6) - 16 freq littlans (7) - 2 freq lotterie (7) - 1 freq littlin (7) - 17 freq nettletar (7) - 1 freq littlins (7) - 25 freq latter (7) - 24 freq bottlemen (7) - 1 freq settler (7) - 1 freq littilest (7) - 1 freq cattleman (7) - 2 freq lottery (7) - 29 freq lyttle (7) - 2 freq laitter (7) - 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 - LTLMR littlemore - 2 freq |
LITTLEMORE |
| Time to execute Levenshtein function - 0.213945 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.451370 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.030732 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.037929 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.000866 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. |