| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lippend (0) - 1 freq lippens (1) - 24 freq lippen (1) - 68 freq lippened (1) - 11 freq lippent (1) - 13 freq hippens (2) - 5 freq blipped (2) - 1 freq lipper (2) - 14 freq lippan (2) - 1 freq slippen (2) - 1 freq tipped (2) - 14 freq clipped (2) - 8 freq slipped (2) - 45 freq happend (2) - 1 freq hippened (2) - 1 freq append (2) - 2 freq ripped (2) - 40 freq lippenin (2) - 29 freq lippers (2) - 9 freq zipped (2) - 5 freq nipped (2) - 22 freq wipped (2) - 1 freq lippenan (2) - 1 freq rippen (2) - 5 freq dipped (2) - 23 freq |
lippend (0) - 1 freq lippened (1) - 11 freq lippens (2) - 24 freq lippen (2) - 68 freq lippent (2) - 13 freq lippered (3) - 2 freq lippenan (3) - 1 freq lippenin (3) - 29 freq lippin (3) - 9 freq lippn (3) - 1 freq hippened (3) - 1 freq lapped (3) - 4 freq lopped (3) - 1 freq append (3) - 2 freq lippan (3) - 1 freq happend (3) - 1 freq unlippened (4) - 1 freq lapping (4) - 1 freq nippen (4) - 1 freq lapland (4) - 3 freq lisped (4) - 1 freq happened (4) - 445 freq hoppened (4) - 1 freq lippinin (4) - 2 freq oppened (4) - 22 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 |
LIPPEND |
| Time to execute Levenshtein function - 0.232309 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.337328 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.030167 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.037436 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.000854 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. |