| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lapperin (0) - 1 freq clapperin (1) - 1 freq lipperin (1) - 8 freq kipperin (2) - 1 freq appearin (2) - 23 freq layerin (2) - 1 freq appenin (2) - 3 freq lapper (2) - 1 freq lippenin (2) - 29 freq pepperin (2) - 3 freq tipperin (2) - 2 freq tapperon (2) - 1 freq paperin (2) - 2 freq lipperan (2) - 2 freq caperin (2) - 3 freq apperit (2) - 3 freq pipperin (2) - 3 freq happenin (2) - 144 freq lappers (2) - 1 freq taperin (2) - 1 freq lappin (2) - 20 freq clipperin (2) - 2 freq lappert (2) - 1 freq rappered (3) - 1 freq lippers (3) - 9 freq |
lapperin (0) - 1 freq lipperin (1) - 8 freq clapperin (2) - 1 freq lipperan (2) - 2 freq appearin (3) - 23 freq kipperin (3) - 1 freq pipperin (3) - 3 freq lappert (3) - 1 freq clipperin (3) - 2 freq lappers (3) - 1 freq paperin (3) - 2 freq tapperon (3) - 1 freq lippenin (3) - 29 freq lapper (3) - 1 freq lappin (3) - 20 freq pepperin (3) - 3 freq tipperin (3) - 2 freq lippert (4) - 1 freq slipperine (4) - 2 freq lippnin (4) - 2 freq lippen (4) - 69 freq lippin (4) - 9 freq lippered (4) - 2 freq lappan (4) - 1 freq lippenan (4) - 1 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 |
LAPPERIN |
| Time to execute Levenshtein function - 0.199654 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.339863 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.027445 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.037524 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.000894 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. |