Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lib-dem (0) - 1 freq libdem (1) - 2 freq lib-dems (1) - 4 freq libdems (2) - 4 freq linden (3) - 11 freq libre (3) - 1 freq libree (3) - 4 freq lieder (3) - 4 freq liddel (3) - 2 freq libbed (3) - 1 freq eik-nem (3) - 1 freq libbie (3) - 1 freq leaden (4) - 1 freq tide' (4) - 1 freq tiber (4) - 1 freq hides (4) - 14 freq dem (4) - 722 freq lifier (4) - 1 freq linkie (4) - 3 freq mibbe (4) - 372 freq libby (4) - 10 freq 'ides (4) - 1 freq lifie (4) - 5 freq liken (4) - 5 freq ridden (4) - 8 freq |
lib-dem (0) - 1 freq lib-dems (2) - 4 freq libdem (2) - 2 freq libdems (4) - 4 freq libbed (5) - 1 freq ladym (6) - 2 freq lab-rat (6) - 1 freq by-nem (6) - 1 freq -dom (6) - 2 freq lobbed (6) - 6 freq oil-drum (6) - 1 freq boddem (6) - 1 freq lobbied (6) - 1 freq alibammm (6) - 2 freq ludm (6) - 1 freq b-day (6) - 1 freq lap-dug (6) - 1 freq labored (6) - 1 freq libre (6) - 1 freq lieder (6) - 4 freq libree (6) - 4 freq liddel (6) - 2 freq linden (6) - 11 freq libbie (6) - 1 freq eik-nem (6) - 1 freq |
SoundEx code - L135 liftin - 75 freq left-haun - 9 freq lifetime - 52 freq lvidence - 1 freq left-wing - 6 freq lifetimes - 5 freq leviathan - 3 freq lifetime's - 5 freq luftmensch - 1 freq lifting - 3 freq law-abidin - 1 freq lefthaund - 1 freq lib-dem - 1 freq 'left-wing' - 1 freq lib-dems - 4 freq life-time - 1 freq luved-ane - 1 freq lap-dancer - 1 freq left-haand - 2 freq lyfetyme - 2 freq liftan - 3 freq lif'tim' - 1 freq lif'tim'o' - 1 freq leeve-doon - 1 freq left-han - 2 freq labiodentals - 1 freq labiodental - 2 freq luftin - 2 freq lipton - 8 freq lipton's - 1 freq left-handed - 2 freq liptons - 4 freq €˜lowp-the-muin - 1 freq libdem - 2 freq libdems - 4 freq liftin's - 1 freq lbtmf - 1 freq lowfoodmiles - 1 freq life-tinkin - 1 freq lovedunfermline - 1 freq |
MetaPhone code - LBTM lib-dem - 1 freq libdem - 2 freq |
LIB-DEM |
Time to execute Levenshtein function - 0.231615 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.369274 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.027594 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.040850 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.000909 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. |