| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| llmvc (0) - 1 freq almac (2) - 1 freq llvl (2) - 1 freq lmvh (2) - 1 freq glove (3) - 11 freq limes (3) - 1 freq ilc (3) - 1 freq slrc (3) - 15 freq ll (3) - 69 freq tevc (3) - 1 freq lms (3) - 1 freq lic (3) - 1 freq leav (3) - 1 freq lumi (3) - 2 freq luive (3) - 9 freq wmc (3) - 1 freq luc (3) - 28 freq lymjs (3) - 1 freq calmac (3) - 1 freq lrc (3) - 1 freq larva (3) - 1 freq olivy (3) - 1 freq lthvf (3) - 4 freq lamp (3) - 79 freq vlv (3) - 1 freq |
llmvc (0) - 1 freq llvl (4) - 1 freq lmvh (4) - 1 freq almac (4) - 1 freq ullvi (5) - 1 freq lilac (5) - 3 freq calmac (5) - 1 freq uillymac (5) - 1 freq llamas (5) - 1 freq livi (6) - 2 freq lemme (6) - 4 freq leeve (6) - 81 freq limn (6) - 2 freq slavs (6) - 1 freq lemon (6) - 23 freq hlmm (6) - 1 freq emva (6) - 1 freq comic (6) - 31 freq tmc (6) - 1 freq mlove (6) - 18 freq alma (6) - 1 freq muc (6) - 1 freq lamech (6) - 3 freq llfox (6) - 1 freq lloyd (6) - 1 freq |
SoundEx code - L512 lamps - 36 freq limbs - 41 freq lambs - 57 freq lumps - 24 freq line-ups - 1 freq lambies - 4 freq lamb-stew - 1 freq lambeg - 5 freq lump's - 2 freq lamppost - 1 freq lambs' - 3 freq lumbs - 1 freq lumpposts - 1 freq lampposts - 5 freq lampstan - 1 freq lamb's - 2 freq lambegs - 1 freq lambie-sheep - 1 freq lamposts - 1 freq laumps - 1 freq lambikie - 1 freq lampshade - 1 freq limps - 1 freq lewmpgxkiz - 1 freq lmubkyb - 1 freq lanpaisleymp - 2 freq lambast - 1 freq llmvc - 1 freq lnwfj - 1 freq lampjaded - 1 freq |
MetaPhone code - LMFK llmvc - 1 freq |
LLMVC |
| Time to execute Levenshtein function - 0.330803 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.667053 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.028420 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.037332 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.000905 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. |