| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lullaby (0) - 7 freq lullabye (1) - 1 freq lullan (2) - 1 freq fullay (2) - 1 freq tullay (2) - 1 freq lallans (3) - 136 freq bulla (3) - 32 freq wullybh (3) - 1 freq fallacy (3) - 1 freq lullabies (3) - 2 freq lalldy (3) - 1 freq pully (3) - 2 freq collab (3) - 1 freq allay (3) - 1 freq hillary (3) - 1 freq mullagh (3) - 1 freq ullans (3) - 32 freq hellay (3) - 1 freq lally (3) - 2 freq lullt (3) - 1 freq sully (3) - 2 freq lallan (3) - 6 freq lulls (3) - 2 freq mellay (3) - 1 freq fullyary (3) - 1 freq |
lullaby (0) - 7 freq lullabye (1) - 1 freq lullan (3) - 1 freq lulled (4) - 3 freq collab (4) - 1 freq lulls (4) - 2 freq lull (4) - 8 freq lullt (4) - 1 freq lally (4) - 2 freq lolly (4) - 1 freq lallan (4) - 6 freq lalldy (4) - 1 freq tullay (4) - 1 freq fullay (4) - 1 freq syllab (4) - 1 freq lellan (4) - 1 freq lullabies (4) - 2 freq loaby (5) - 3 freq dully (5) - 2 freq lanlay (5) - 2 freq lanlady (5) - 5 freq pulley (5) - 9 freq mullguy (5) - 1 freq yellay (5) - 2 freq syllabs (5) - 2 freq |
SoundEx code - L410 lullaby - 7 freq lowlife - 2 freq lullabye - 1 freq lalapie - 1 freq |
MetaPhone code - LLB lullaby - 7 freq |
LULLABY |
| Time to execute Levenshtein function - 0.241056 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.426936 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.027586 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.038985 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.000939 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. |