| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lippenin (0) - 29 freq lipperin (1) - 8 freq lippinin (1) - 2 freq lippnin (1) - 2 freq lippenan (1) - 1 freq lippent (2) - 13 freq kipperin (2) - 1 freq appenin (2) - 3 freq ripenin (2) - 5 freq happenin (2) - 144 freq tipperin (2) - 2 freq listenin (2) - 176 freq oppenin (2) - 6 freq lippens (2) - 24 freq lippen (2) - 68 freq pipperin (2) - 3 freq aipenin (2) - 5 freq lissenin (2) - 6 freq lipperan (2) - 2 freq lippenan' (2) - 1 freq heppenin (2) - 1 freq likenin (2) - 2 freq lippened (2) - 11 freq lippin (2) - 9 freq clipperin (2) - 2 freq |
lippenin (0) - 29 freq lippnin (1) - 2 freq lippenan (1) - 1 freq lippinin (1) - 2 freq lippinen (2) - 1 freq lipperin (2) - 8 freq lippenan' (3) - 1 freq lipperan (3) - 2 freq heppenin (3) - 1 freq lippen (3) - 68 freq lippend (3) - 1 freq lippin (3) - 9 freq lippened (3) - 11 freq lippens (3) - 24 freq oppenin (3) - 6 freq happenin (3) - 144 freq appenin (3) - 3 freq lippent (3) - 13 freq tippenny (4) - 4 freq lippn (4) - 1 freq lippan (4) - 1 freq happenan (4) - 3 freq lippenance (4) - 1 freq happenen (4) - 2 freq happnin (4) - 7 freq |
SoundEx code - L155 lippinin - 2 freq lowpin-on - 1 freq lebanon - 7 freq lippenin - 29 freq lippinen - 1 freq lippnin - 2 freq lippenance - 1 freq loubanana - 1 freq lbnwn - 1 freq lippenan - 1 freq lippenan' - 1 freq |
MetaPhone code - LPNN lippinin - 2 freq lowpin-on - 1 freq lippenin - 29 freq lippinen - 1 freq lippnin - 2 freq lippenan - 1 freq lippenan' - 1 freq |
LIPPENIN |
| Time to execute Levenshtein function - 0.300898 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.527689 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.028295 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.038798 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.000828 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. |