| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lambie-sheep (0) - 1 freq lambies (5) - 4 freq lamb-stew (5) - 1 freq hame-help (5) - 1 freq empie-free (6) - 1 freq jumble-sale (6) - 1 freq naesleep (6) - 1 freq spreid-sheet (6) - 1 freq janiesherb (6) - 11 freq lammie's (6) - 1 freq lavished (6) - 1 freq same-sel (6) - 2 freq maimbership (6) - 30 freq same-sex (6) - 2 freq lambie (6) - 3 freq lassie-like (6) - 1 freq benshees (6) - 2 freq luve-sweet (6) - 1 freq bane-deep (6) - 3 freq ramished (6) - 2 freq horsie-steen (6) - 2 freq sin-sheen (6) - 1 freq barbit-weer (6) - 1 freq razir-sharp (6) - 1 freq ambience (6) - 4 freq |
lambie-sheep (0) - 1 freq lamb-stew (7) - 1 freq membership (8) - 12 freq lambies (8) - 4 freq maimbership (8) - 30 freq lairdship (9) - 4 freq bee-skep (9) - 2 freq ambushed (9) - 1 freq hame-help (9) - 1 freq lambeens (9) - 2 freq lambegs (9) - 1 freq slave-ship (9) - 6 freq sambies (10) - 1 freq like-she's (10) - 1 freq lime-tree (10) - 1 freq manishee (10) - 1 freq razor-sherp (10) - 1 freq memberschip (10) - 1 freq lumbers (10) - 3 freq bedsheet (10) - 2 freq lamb's (10) - 2 freq sweetie-shop (10) - 1 freq cube-shaped (10) - 1 freq lambast (10) - 1 freq lampshade (10) - 1 freq |
SoundEx code - L512 lamps - 36 freq limbs - 37 freq lambs - 56 freq lumps - 21 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 - LMXP lambie-sheep - 1 freq |
LAMBIE-SHEEP |
| Time to execute Levenshtein function - 0.213716 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.408745 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.027285 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.038151 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.000857 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. |