| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jmrabz (0) - 1 freq magz (3) - 1 freq arab (3) - 4 freq scrabo (3) - 3 freq franz (3) - 1 freq jmaj (3) - 1 freq mrez (3) - 1 freq thrab (3) - 2 freq jabs (3) - 2 freq raz (3) - 1 freq jrb (3) - 3 freq jmz (3) - 1 freq joram (3) - 2 freq scraba (3) - 2 freq crabs (3) - 7 freq jsrael (3) - 1 freq vrafz (3) - 1 freq arabs (3) - 4 freq mrsb (3) - 1 freq jerbs (3) - 1 freq abz (3) - 17 freq drab (3) - 7 freq moab (3) - 2 freq bmraqbp (3) - 1 freq jcmrtz (3) - 1 freq |
jmrabz (0) - 1 freq jrb (5) - 3 freq jmz (5) - 1 freq jerbs (5) - 1 freq mrez (5) - 1 freq jcmrtz (5) - 1 freq arabi (6) - 1 freq 'rab (6) - 2 freq jab (6) - 21 freq maiz (6) - 5 freq umrage (6) - 1 freq grabs (6) - 21 freq joab (6) - 119 freq crab (6) - 32 freq jazz (6) - 16 freq jumbo (6) - 13 freq jambo (6) - 5 freq jamb (6) - 2 freq jambs (6) - 1 freq jimbo (6) - 1 freq rab (6) - 172 freq grab (6) - 114 freq jura (6) - 3 freq thrabs (6) - 1 freq rauz (6) - 1 freq |
SoundEx code - J561 jmrabz - 1 freq jimmerfaestoney - 4 freq |
MetaPhone code - JMRBS jmrabz - 1 freq |
JMRABZ |
| Time to execute Levenshtein function - 0.222622 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.346392 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.029223 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.038205 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.000939 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. |