| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xjad (0) - 1 freq xja (1) - 1 freq brad (2) - 4 freq xdaw (2) - 1 freq jaud (2) - 6 freq soad (2) - 1 freq kad (2) - 1 freq ajod (2) - 1 freq mad (2) - 345 freq whad (2) - 3 freq twad (2) - 1 freq scad (2) - 6 freq jar (2) - 41 freq baad (2) - 20 freq daad (2) - 5 freq xkd (2) - 1 freq blad (2) - 15 freq oad (2) - 2 freq xua (2) - 2 freq xcd (2) - 1 freq xnax (2) - 1 freq 'had (2) - 1 freq jah (2) - 2 freq jai (2) - 1 freq sjao (2) - 1 freq |
xjad (0) - 1 freq xja (2) - 1 freq jed (3) - 53 freq jade (3) - 14 freq jd (3) - 5 freq xkd (3) - 1 freq xju (3) - 1 freq xje (3) - 1 freq xuaj (3) - 1 freq xjb (3) - 1 freq xcd (3) - 1 freq xd (3) - 4 freq ajod (3) - 1 freq jaud (3) - 6 freq xvud (3) - 1 freq xji (3) - 1 freq xmd (3) - 1 freq yjd (3) - 1 freq xjle (3) - 1 freq xejay (3) - 1 freq ajar (4) - 4 freq rdad (4) - 1 freq jap (4) - 2 freq 'jam (4) - 1 freq had (4) - 4968 freq |
SoundEx code - X300 ”xt - 1 freq xdaw - 1 freq xd - 4 freq xut - 1 freq xkd - 1 freq xcd - 1 freq xst - 1 freq xt - 1 freq xjad - 1 freq |
MetaPhone code - SJT seigit - 1 freq sjt - 1 freq xjad - 1 freq |
XJAD |
| Time to execute Levenshtein function - 0.209889 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.363832 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.028774 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.037173 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.000839 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. |