| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ylzrj (0) - 1 freq lzra (2) - 1 freq lgr (3) - 1 freq xlz (3) - 1 freq lnj (3) - 2 freq zj (3) - 1 freq mtzj (3) - 1 freq lpr (3) - 1 freq yark (3) - 8 freq lirk (3) - 5 freq blurt (3) - 1 freq glore (3) - 5 freq yarn (3) - 49 freq yeers (3) - 2 freq yair (3) - 1 freq wazrl (3) - 1 freq youre (3) - 2 freq slur (3) - 4 freq yard (3) - 43 freq sczj (3) - 1 freq yr (3) - 16 freq flr (3) - 3 freq yzrls (3) - 1 freq lire (3) - 2 freq ypzle (3) - 1 freq |
ylzrj (0) - 1 freq lzra (3) - 1 freq lzje (4) - 1 freq zrr (5) - 1 freq lzxy (5) - 1 freq pzj (5) - 1 freq olr (5) - 2 freq lr (5) - 5 freq azr (5) - 1 freq rj (5) - 2 freq lorn (5) - 1 freq lyre (5) - 1 freq rzr (5) - 1 freq larn (5) - 16 freq fmrj (5) - 1 freq lere (5) - 2 freq trj (5) - 1 freq lyj (5) - 1 freq lure (5) - 6 freq lnnj (5) - 1 freq ler (5) - 1 freq lzg (5) - 1 freq wzrz (5) - 1 freq ultra (5) - 4 freq lozart (5) - 1 freq |
SoundEx code - Y426 yallicrack - 1 freq yolkers - 1 freq ylgckrvnk - 1 freq yljorzic - 1 freq yul-girs - 1 freq ylzrj - 1 freq |
MetaPhone code - LSRJ ylzrj - 1 freq |
YLZRJ |
| Time to execute Levenshtein function - 0.214478 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.352846 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.028230 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.037956 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.000858 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. |