| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lclq (0) - 1 freq lcj (2) - 1 freq lle (2) - 1 freq lc (2) - 3 freq lulu (2) - 2 freq lal (2) - 1 freq lol (2) - 1606 freq lilt (2) - 22 freq lile (2) - 1 freq clx (2) - 1 freq lrq (2) - 1 freq lxq (2) - 1 freq pcly (2) - 1 freq tcq (2) - 1 freq clo (2) - 1 freq lced (2) - 1 freq clc (2) - 1 freq lulz (2) - 1 freq tlcmq (2) - 1 freq ll (2) - 69 freq lcz (2) - 1 freq lll (2) - 3 freq rcqq (2) - 1 freq sllq (2) - 1 freq lch (2) - 1 freq |
lclq (0) - 1 freq cliq (3) - 1 freq lclat (3) - 1 freq scl (4) - 1 freq qzlq (4) - 1 freq wcq (4) - 1 freq cln (4) - 1 freq lgl (4) - 1 freq lq (4) - 4 freq lily (4) - 44 freq lilo (4) - 1 freq lols (4) - 2 freq llb (4) - 1 freq lila (4) - 1 freq ldl (4) - 2 freq coq (4) - 1 freq lili (4) - 2 freq cla (4) - 1 freq cl (4) - 5 freq rlq (4) - 1 freq local (4) - 413 freq locale (4) - 1 freq locals (4) - 39 freq ldq (4) - 1 freq lckl (4) - 1 freq |
SoundEx code - L242 locals - 39 freq locals' - 1 freq lochalsh - 1 freq laich-liggin - 1 freq lookalike - 2 freq localised - 8 freq localism - 1 freq lookalikie - 1 freq look-alikes - 1 freq lugholes - 1 freq legless - 3 freq locails - 2 freq luckless - 2 freq lauch-lauchin - 1 freq less-weil-kent - 1 freq lassie-like - 1 freq lowe-clok - 1 freq localspace - 1 freq localisation - 4 freq luik-alike - 1 freq lokals - 1 freq lzals - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq ljeeulgf - 1 freq |
MetaPhone code - LKLK lookalike - 2 freq lookalikie - 1 freq luik-alike - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq |
LCLQ |
| Time to execute Levenshtein function - 0.229530 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.423682 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.030135 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.042370 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.000904 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. |