| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lxb (0) - 1 freq lpb (1) - 1 freq lwb (1) - 1 freq lb (1) - 4 freq bxb (1) - 1 freq lob (1) - 5 freq xb (1) - 3 freq olxb (1) - 1 freq lxn (1) - 1 freq lx (1) - 3 freq lib (1) - 13 freq lab (1) - 29 freq lxr (1) - 1 freq lxq (1) - 1 freq llb (1) - 1 freq nxb (1) - 1 freq lkb (1) - 1 freq yxx (2) - 1 freq lkf (2) - 1 freq blab (2) - 3 freq lj (2) - 2 freq fb (2) - 27 freq cxi (2) - 1 freq loe (2) - 15 freq mob (2) - 26 freq |
lxb (0) - 1 freq olxb (1) - 1 freq lab (2) - 29 freq lib (2) - 13 freq lxr (2) - 1 freq llb (2) - 1 freq lkb (2) - 1 freq nxb (2) - 1 freq lx (2) - 3 freq lxq (2) - 1 freq lwb (2) - 1 freq lxn (2) - 1 freq lpb (2) - 1 freq bxb (2) - 1 freq lb (2) - 4 freq lob (2) - 5 freq xb (2) - 3 freq loxy (3) - 4 freq lix (3) - 1 freq lube (3) - 1 freq alab (3) - 1 freq lamb (3) - 63 freq xoxb (3) - 1 freq lex (3) - 2 freq lax (3) - 2 freq |
SoundEx code - L210 lisboa - 1 freq laughabie - 1 freq lowse-up - 1 freq lock-up - 3 freq lassve - 1 freq look-up - 1 freq lugfoo - 1 freq lisp - 2 freq loackup - 3 freq lusv - 1 freq lohwggsghp - 1 freq lueksb - 1 freq lucifie - 1 freq liqf - 1 freq lkf - 1 freq lgzf - 1 freq lxb - 1 freq lkb - 1 freq loyccxvwhh - 1 freq |
MetaPhone code - LKSB lueksb - 1 freq lxb - 1 freq |
LXB |
| Time to execute Levenshtein function - 0.216690 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.339997 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.027734 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.037475 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.000928 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. |