| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spliff (0) - 8 freq skliff (1) - 4 freq scliff (1) - 7 freq sclaff (2) - 4 freq skyiff (2) - 1 freq uplift (2) - 5 freq spraff (2) - 3 freq piff (2) - 1 freq sklif (2) - 1 freq splits (2) - 9 freq shaiff (2) - 3 freq splint (2) - 1 freq pluff (2) - 4 freq stiff (2) - 56 freq scliffs (2) - 3 freq split (2) - 74 freq spoff (2) - 4 freq cliff (2) - 27 freq skleff (2) - 2 freq liff (2) - 2 freq aplift (2) - 1 freq skiff (2) - 12 freq stoiff (2) - 2 freq sclifft (2) - 1 freq sniff (2) - 28 freq |
spliff (0) - 8 freq scliff (2) - 7 freq skliff (2) - 4 freq pluff (3) - 4 freq spraff (3) - 3 freq skleff (3) - 2 freq sclaff (3) - 4 freq spoff (3) - 4 freq aplift (4) - 1 freq liff (4) - 2 freq skiff (4) - 12 freq gliff (4) - 35 freq seacliff (4) - 1 freq pluffy (4) - 1 freq cliff (4) - 27 freq sniff (4) - 28 freq stoiff (4) - 2 freq sclifft (4) - 1 freq sklif (4) - 1 freq piff (4) - 1 freq skyiff (4) - 1 freq uplift (4) - 5 freq split (4) - 74 freq splits (4) - 9 freq stiff (4) - 56 freq |
SoundEx code - S141 spellboun - 1 freq splap - 1 freq spliff - 8 freq shoaplifters - 1 freq shopliftin - 6 freq spellboond - 1 freq spellbound - 4 freq spailbane - 1 freq splehfit - 1 freq shovelfu - 1 freq shoplifting - 1 freq shuffleboard - 1 freq splbanter - 5 freq |
MetaPhone code - SPLF spliff - 8 freq |
SPLIFF |
| Time to execute Levenshtein function - 0.171507 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.348879 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.027564 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.038514 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.000839 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. |