| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mbtykxu (0) - 1 freq btmknxu (3) - 1 freq ebkxd (4) - 1 freq boykie (4) - 1 freq bayou (4) - 1 freq mvpyx (4) - 1 freq rqzykxd (4) - 1 freq tvxu (4) - 1 freq sbptyu (4) - 1 freq rbtfqu (4) - 1 freq pityfu (4) - 2 freq byk (4) - 1 freq muiykgk (4) - 1 freq mku (4) - 1 freq pbrkktu (4) - 1 freq btgu (4) - 1 freq styou (4) - 3 freq mtu (4) - 1 freq tyke (4) - 27 freq mqkyk (4) - 1 freq mnixu (4) - 1 freq byke (4) - 8 freq ttdku (4) - 1 freq mathieu (4) - 1 freq qbtokdc (4) - 1 freq |
mbtykxu (0) - 1 freq mbanks (6) - 1 freq matrix (6) - 1 freq mbwx (6) - 1 freq mbtw (6) - 1 freq cbtk (6) - 1 freq motoki (6) - 1 freq btmknxu (6) - 1 freq embarked (7) - 1 freq mxyu (7) - 1 freq embraked (7) - 1 freq byker (7) - 1 freq mbpfuu (7) - 1 freq bkxb (7) - 1 freq mby (7) - 1 freq mistak (7) - 41 freq tykes (7) - 7 freq mortakty (7) - 1 freq mistaken (7) - 7 freq xtkox (7) - 1 freq mistakin (7) - 1 freq betwix (7) - 2 freq mbskare (7) - 1 freq botox (7) - 2 freq mistakes (7) - 18 freq |
SoundEx code - M132 mopeds - 1 freq moffat's - 3 freq muppets - 5 freq mbtykxu - 1 freq mbatyejea - 1 freq miffythegamer - 1 freq |
MetaPhone code - MTKKS mbtykxu - 1 freq |
MBTYKXU |
| Time to execute Levenshtein function - 0.201813 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.385082 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.027753 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.040995 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.000911 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. |