| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lambeg (0) - 5 freq lambed (1) - 2 freq lambegs (1) - 1 freq lamped (2) - 2 freq lambeen (2) - 3 freq label (2) - 57 freq limbed (2) - 1 freq lames (2) - 1 freq bamber (2) - 2 freq lamb's (2) - 2 freq lamb (2) - 63 freq labeo (2) - 1 freq camber (2) - 1 freq lamban (2) - 2 freq limber (2) - 2 freq lame' (2) - 1 freq lasheg (2) - 1 freq garbeg (2) - 2 freq lammer (2) - 2 freq lumber (2) - 5 freq lambo (2) - 1 freq lambert (2) - 3 freq lambs' (2) - 3 freq amber (2) - 13 freq lambies (2) - 4 freq |
lambeg (0) - 5 freq lambegs (2) - 1 freq lambed (2) - 2 freq lambo (3) - 1 freq lumber (3) - 5 freq limber (3) - 2 freq lambies (3) - 4 freq lambing (3) - 1 freq lambin (3) - 19 freq lamban (3) - 2 freq lambie (3) - 3 freq lambs (3) - 57 freq limbed (3) - 1 freq lamb (3) - 63 freq lambeen (3) - 3 freq lamped (4) - 2 freq lame' (4) - 1 freq clamber (4) - 5 freq lumbs (4) - 1 freq limbie (4) - 1 freq camber (4) - 1 freq limbs (4) - 41 freq limb (4) - 14 freq humbug (4) - 5 freq lamalaeg (4) - 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 - LMK lambeg - 5 freq lambikie - 1 freq |
LAMBEG |
| Time to execute Levenshtein function - 0.505556 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.384513 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.028887 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.042634 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.000868 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. |