| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lisps (0) - 1 freq lisp (1) - 2 freq limps (1) - 1 freq lists (1) - 18 freq liss (1) - 2 freq lips (1) - 198 freq wisps (1) - 3 freq lss (2) - 1 freq linns (2) - 5 freq kips (2) - 3 freq riss (2) - 2 freq imps (2) - 3 freq lions (2) - 35 freq lins (2) - 3 freq libs (2) - 1 freq wesps (2) - 1 freq tips (2) - 26 freq crisps (2) - 34 freq limos (2) - 1 freq likks (2) - 2 freq wips (2) - 1 freq piss (2) - 72 freq less (2) - 552 freq hips (2) - 32 freq lisa (2) - 16 freq |
lisps (0) - 1 freq lips (2) - 198 freq liss (2) - 2 freq wisps (2) - 3 freq lisp (2) - 2 freq limps (2) - 1 freq lists (2) - 18 freq lass (3) - 496 freq lowps (3) - 29 freq rasps (3) - 11 freq loss (3) - 200 freq msps (3) - 30 freq wusps (3) - 1 freq csps (3) - 1 freq leaps (3) - 7 freq esps (3) - 2 freq wasps (3) - 4 freq hesps (3) - 2 freq loops (3) - 4 freq loups (3) - 6 freq lups (3) - 1 freq lisa's (3) - 1 freq lamps (3) - 36 freq lasts (3) - 17 freq lumps (3) - 24 freq |
SoundEx code - L212 lassie-bashin - 1 freq lace-ups - 1 freq lochboisdale - 1 freq lisps - 1 freq lockfast - 1 freq lock-back - 1 freq lockups - 1 freq lascivious - 1 freq lesbos - 2 freq lsfsvas - 1 freq lazybastard - 1 freq ljovjlrtc - 1 freq lochabskyepol - 1 freq lggjxfgcj - 1 freq lkhuoffxye - 1 freq lug-buik - 1 freq lkhbpz - 1 freq lqwvghpwm - 1 freq lascapigliata - 1 freq lgfz - 1 freq lqkjfxxqaq - 1 freq lgvqz - 1 freq lssfzyb - 2 freq |
MetaPhone code - LSPS lace-ups - 1 freq lisps - 1 freq |
LISPS |
| Time to execute Levenshtein function - 0.220674 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.431760 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.036670 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.046865 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.001164 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. |