| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xsfl (0) - 1 freq xsl (1) - 1 freq dsfl (1) - 1 freq scl (2) - 1 freq sl (2) - 7 freq xst (2) - 1 freq vsl (2) - 1 freq skl (2) - 1 freq esel (2) - 2 freq sfa (2) - 28 freq efl (2) - 2 freq nfl (2) - 2 freq xs (2) - 2 freq pskl (2) - 1 freq asl (2) - 1 freq xrql (2) - 1 freq xcf (2) - 1 freq xczl (2) - 1 freq xsyi (2) - 1 freq jsl (2) - 1 freq sf (2) - 6 freq xsoj (2) - 1 freq psml (2) - 23 freq xfu (2) - 1 freq dsl (2) - 28 freq |
xsfl (0) - 1 freq xsl (2) - 1 freq dsfl (2) - 1 freq eosfl (3) - 1 freq sxl (4) - 1 freq msfc (4) - 3 freq zsl (4) - 1 freq sel (4) - 75 freq xnfb (4) - 1 freq spl (4) - 4 freq nsfw (4) - 4 freq gsfc (4) - 2 freq sal (4) - 56 freq gsf (4) - 1 freq pfl (4) - 1 freq xl (4) - 3 freq xtl (4) - 1 freq xol (4) - 1 freq spfl (4) - 14 freq usefal (4) - 1 freq useful (4) - 24 freq axfil (4) - 1 freq sfp (4) - 4 freq fsl (4) - 1 freq wsf (4) - 1 freq |
SoundEx code - X140 xsfl - 1 freq |
MetaPhone code - SSFL xsfl - 1 freq |
XSFL |
| Time to execute Levenshtein function - 0.187076 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.498093 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.031772 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.038256 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.000880 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. |