| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jslv (0) - 1 freq jsl (1) - 1 freq js (2) - 5 freq jill (2) - 14 freq oslo (2) - 11 freq hlv (2) - 1 freq jfv (2) - 1 freq esli (2) - 3 freq stv (2) - 12 freq slx (2) - 1 freq osla (2) - 1 freq j'll (2) - 3 freq jfwv (2) - 2 freq lv (2) - 6 freq sls (2) - 8 freq jsr (2) - 1 freq jl (2) - 4 freq jv (2) - 2 freq njsl (2) - 1 freq isle (2) - 81 freq msxv (2) - 1 freq sly (2) - 15 freq ssl (2) - 1 freq jpl (2) - 2 freq jlk (2) - 1 freq |
jslv (0) - 1 freq jsl (2) - 1 freq joliv (3) - 3 freq sylv (3) - 3 freq isla (4) - 26 freq asls (4) - 25 freq tulv (4) - 1 freq vlv (4) - 1 freq jmwv (4) - 1 freq usli (4) - 1 freq sl (4) - 7 freq gsv (4) - 2 freq jll (4) - 1 freq sld (4) - 9 freq fxlv (4) - 1 freq jnlf (4) - 1 freq jojv (4) - 1 freq jql (4) - 1 freq jarv (4) - 15 freq fsl (4) - 1 freq slo (4) - 4 freq jyle (4) - 47 freq jklr (4) - 1 freq solve (4) - 9 freq salve (4) - 5 freq |
SoundEx code - J410 jallopy - 4 freq jallop - 1 freq jeelip - 2 freq joliv - 3 freq jalopy - 1 freq jslv - 1 freq |
MetaPhone code - JSLF jslv - 1 freq |
JSLV |
| Time to execute Levenshtein function - 0.203952 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.397300 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.031538 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.038508 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.001048 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. |