| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lippened (0) - 11 freq lippend (1) - 1 freq lippered (1) - 2 freq hippened (1) - 1 freq likened (2) - 1 freq aipened (2) - 4 freq appened (2) - 5 freq lippen (2) - 68 freq lichened (2) - 2 freq lippinen (2) - 1 freq tippered (2) - 1 freq listened (2) - 86 freq hoppened (2) - 1 freq slippered (2) - 2 freq lippenan (2) - 1 freq lippent (2) - 13 freq unlippened (2) - 1 freq ripened (2) - 2 freq oppened (2) - 22 freq tippexed (2) - 1 freq pippered (2) - 1 freq lippens (2) - 24 freq lippenin (2) - 29 freq lissened (2) - 1 freq happened (2) - 445 freq |
lippened (0) - 11 freq lippend (1) - 1 freq hippened (2) - 1 freq lippered (2) - 2 freq lippent (3) - 13 freq lippenan (3) - 1 freq unlippened (3) - 1 freq lippenin (3) - 29 freq hoppened (3) - 1 freq lippens (3) - 24 freq oppened (3) - 22 freq happened (3) - 445 freq appened (3) - 5 freq lippinen (3) - 1 freq lippen (3) - 68 freq happend (4) - 1 freq lippan (4) - 1 freq lapped (4) - 4 freq lopped (4) - 1 freq listened (4) - 86 freq likened (4) - 1 freq lippnin (4) - 2 freq supponed (4) - 1 freq lippn (4) - 1 freq lippinin (4) - 2 freq |
SoundEx code - L153 lippent - 13 freq lavender - 58 freq loup-hunter - 1 freq leavin't - 2 freq loaf-ends - 2 freq lippend - 1 freq 'lavender - 1 freq lavender's - 4 freq leavent - 1 freq lippened - 11 freq lovematch - 1 freq life-mate - 1 freq lavin-time - 1 freq |
MetaPhone code - LPNT lippent - 13 freq lippend - 1 freq lippened - 11 freq |
LIPPENED |
| Time to execute Levenshtein function - 0.243689 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.362303 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.027703 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.040579 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.000848 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. |