Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lippenin (0) - 29 freq lippinin (1) - 2 freq lippenan (1) - 1 freq lippnin (1) - 2 freq lipperin (1) - 8 freq oppenin (2) - 6 freq lipperan (2) - 2 freq lippend (2) - 1 freq lippinen (2) - 1 freq clipperin (2) - 2 freq lippened (2) - 11 freq pipperin (2) - 3 freq ripenin (2) - 5 freq likenin (2) - 2 freq kipperin (2) - 1 freq lapperin (2) - 1 freq aipenin (2) - 5 freq lippenan' (2) - 1 freq happenin (2) - 144 freq lissenin (2) - 6 freq appenin (2) - 3 freq lippin (2) - 9 freq heppenin (2) - 1 freq tipperin (2) - 2 freq lippen (2) - 69 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 appenin (3) - 3 freq lippin (3) - 9 freq happenin (3) - 144 freq lippenan' (3) - 1 freq lippens (3) - 24 freq lapperin (3) - 1 freq lippen (3) - 69 freq heppenin (3) - 1 freq lippent (3) - 13 freq lippend (3) - 1 freq lipperan (3) - 2 freq lippened (3) - 11 freq oppenin (3) - 6 freq happnin (4) - 7 freq happenen (4) - 2 freq lippan (4) - 1 freq kipperin (4) - 1 freq lippn (4) - 1 freq lappin (4) - 20 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.199283 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.335006 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.030071 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.038713 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.000930 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. |