| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lipperan (0) - 2 freq lippenan (1) - 1 freq lipperin (1) - 8 freq lippen (2) - 69 freq lippenan' (2) - 1 freq lipper (2) - 14 freq lapperin (2) - 1 freq lippert (2) - 1 freq lippenin (2) - 29 freq kipperin (2) - 1 freq tipperin (2) - 2 freq lippan (2) - 1 freq pipperin (2) - 3 freq lippers (2) - 9 freq lippered (2) - 2 freq clipperin (2) - 2 freq libran (3) - 1 freq rippan (3) - 1 freq liberal (3) - 26 freq slippery (3) - 12 freq liegeman (3) - 1 freq clippers' (3) - 1 freq pivveran (3) - 1 freq nippen (3) - 1 freq ripplan (3) - 2 freq |
lipperan (0) - 2 freq lipperin (1) - 8 freq lippenan (2) - 1 freq lapperin (2) - 1 freq pipperin (3) - 3 freq lippan (3) - 1 freq tipperin (3) - 2 freq clipperin (3) - 2 freq lippers (3) - 9 freq lippered (3) - 2 freq kipperin (3) - 1 freq lipper (3) - 14 freq lippen (3) - 69 freq lippert (3) - 1 freq lippenin (3) - 29 freq lapper (4) - 1 freq lippinen (4) - 1 freq lappert (4) - 1 freq pepperin (4) - 3 freq lappan (4) - 1 freq clapperin (4) - 1 freq lappers (4) - 1 freq lipperous (4) - 1 freq tapperon (4) - 1 freq lippin (4) - 9 freq |
SoundEx code - L165 lapperin - 1 freq labyrinth - 22 freq lipperin - 8 freq labourin - 3 freq lipperan - 2 freq laburnum - 1 freq life-rent - 1 freq labyrinthine - 1 freq leverin - 2 freq labyrinths - 1 freq labour-men - 1 freq labouring - 2 freq labourin' - 1 freq life-worn - 1 freq lawbourin - 3 freq labour-intensive - 1 freq lfrmr - 1 freq libran - 1 freq loveworms - 1 freq 'laverni' - 1 freq 'liverni' - 1 freq |
MetaPhone code - LPRN lapperin - 1 freq lipperin - 8 freq lipperan - 2 freq |
LIPPERAN |
| Time to execute Levenshtein function - 0.266530 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.479602 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.059936 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.039453 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.036041 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. |