| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lickery-lowpers (0) - 1 freq interlowpers (5) - 2 freq joukery-powkery (6) - 5 freq interlowper (6) - 1 freq dyke-lowper (6) - 1 freq strand-lowpers (7) - 1 freq jiggery-pokery (7) - 1 freq girselowper (7) - 1 freq gresslowpers (7) - 1 freq monkeyflower (7) - 1 freq lickety-split (7) - 1 freq tidier-uppers (7) - 1 freq joukery-pawkery (7) - 3 freq picket-lines (7) - 1 freq ticker-tape (7) - 1 freq lucky-lines (7) - 1 freq interlouper (7) - 1 freq cornflowers (7) - 1 freq lichen-covert (7) - 2 freq aichty-fower (7) - 1 freq lie-lown (8) - 1 freq likeliness (8) - 1 freq mixter-maxters (8) - 2 freq hedder-kowes (8) - 1 freq liveborders (8) - 1 freq |
lickery-lowpers (0) - 1 freq interlowpers (9) - 2 freq dyke-lowper (10) - 1 freq lucky-lines (11) - 1 freq interlowper (11) - 1 freq joukery-powkery (11) - 5 freq joukery-pawkery (12) - 3 freq picket-lines (12) - 1 freq cornflowers (12) - 1 freq tidier-uppers (12) - 1 freq ticker-tape (12) - 1 freq lickety-split (12) - 1 freq strand-lowpers (12) - 1 freq girselowper (12) - 1 freq gresslowpers (12) - 1 freq laund-owners (13) - 2 freq sooker-upper (13) - 1 freq mckerrow's (13) - 1 freq share-owners (13) - 1 freq lickers (13) - 2 freq clock-tower (13) - 1 freq stranlowper (13) - 1 freq luk-ower (13) - 4 freq monkeyflower (13) - 1 freq aichty-fower (13) - 1 freq |
SoundEx code - L264 leisurely - 3 freq leisur-like - 1 freq lickery-lowpers - 1 freq leesurely - 1 freq leisurelie - 1 freq loggarly - 1 freq |
MetaPhone code - LKRLPRS lickery-lowpers - 1 freq |
LICKERY-LOWPERS |
| Time to execute Levenshtein function - 0.254000 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.482292 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.029025 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.039059 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.000984 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. |