| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| splap (0) - 1 freq splat (1) - 8 freq slap (1) - 55 freq plap (1) - 2 freq slam (2) - 15 freq split (2) - 77 freq spad (2) - 2 freq pap (2) - 21 freq flap (2) - 32 freq shap (2) - 26 freq slaps (2) - 12 freq uplan (2) - 4 freq spat (2) - 52 freq splut (2) - 2 freq plan (2) - 236 freq poap (2) - 1 freq speak (2) - 565 freq slaa (2) - 3 freq plav (2) - 1 freq staap (2) - 1 freq spear (2) - 28 freq salad (2) - 30 freq scap (2) - 2 freq spak (2) - 307 freq slip (2) - 66 freq |
splap (0) - 1 freq slap (2) - 55 freq plap (2) - 2 freq splat (2) - 8 freq splaat (3) - 1 freq slip (3) - 66 freq slep (3) - 10 freq sxlp (3) - 1 freq sdlp (3) - 1 freq splut (3) - 2 freq slop (3) - 2 freq speal (3) - 1 freq mplp (3) - 1 freq splh (3) - 1 freq split (3) - 77 freq splet (3) - 5 freq spl (3) - 4 freq plip (3) - 1 freq plop (3) - 4 freq sprp (3) - 1 freq spill (4) - 24 freq splayed (4) - 2 freq splayin (4) - 1 freq spylte (4) - 1 freq spaley (4) - 3 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 - SPLP splap - 1 freq |
SPLAP |
| Time to execute Levenshtein function - 0.249099 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.404185 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.027448 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.037692 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.000869 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. |