| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lipper (0) - 14 freq ripper (1) - 10 freq dipper (1) - 3 freq lippen (1) - 69 freq lippers (1) - 9 freq tipper (1) - 14 freq slipper (1) - 4 freq lippert (1) - 1 freq clipper (1) - 3 freq pipper (1) - 2 freq kipper (1) - 5 freq lapper (1) - 1 freq flipper (1) - 2 freq nipper (1) - 1 freq liper (1) - 1 freq sipper (1) - 6 freq nippet (2) - 10 freq linger (2) - 5 freq kippers (2) - 7 freq iper (2) - 7 freq lither (2) - 1 freq lippin (2) - 9 freq papper (2) - 1 freq clippert (2) - 1 freq clippers (2) - 6 freq |
lipper (0) - 14 freq lapper (1) - 1 freq kipper (2) - 5 freq flipper (2) - 2 freq nipper (2) - 1 freq sipper (2) - 6 freq liper (2) - 1 freq pipper (2) - 2 freq ripper (2) - 10 freq lippen (2) - 69 freq clipper (2) - 3 freq lippers (2) - 9 freq dipper (2) - 3 freq lippert (2) - 1 freq slipper (2) - 4 freq tipper (2) - 14 freq napper (3) - 36 freq upper (3) - 55 freq copper (3) - 22 freq piper (3) - 31 freq flapper (3) - 5 freq lopped (3) - 1 freq supper (3) - 173 freq wapper (3) - 2 freq leper (3) - 2 freq |
SoundEx code - L160 labour - 276 freq livery - 13 freq laubour - 2 freq lover - 27 freq leper - 2 freq liver - 34 freq labour' - 1 freq liefer - 5 freq luver - 8 freq lipper - 14 freq libary - 1 freq liper - 1 freq lapper - 1 freq libra - 2 freq laebor - 1 freq lifier - 1 freq lever - 2 freq Álvaro - 1 freq libre - 1 freq leifer - 2 freq lebor - 1 freq libree - 4 freq lawborrow - 2 freq lawbur - 1 freq laubor - 1 freq lawburrow - 1 freq lawbour - 5 freq libarry - 1 freq 'labour - 1 freq livari - 1 freq louvre - 1 freq live-wire - 1 freq loafer - 1 freq labor - 1 freq lpr - 1 freq libr - 1 freq |
MetaPhone code - LPR leper - 2 freq lipper - 14 freq liper - 1 freq lapper - 1 freq lpr - 1 freq |
LIPPER |
| Time to execute Levenshtein function - 0.198211 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.377565 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.029578 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.038890 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.000969 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. |