| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jabbin (0) - 8 freq nabbin (1) - 2 freq jabbit (1) - 3 freq gabbin (1) - 19 freq sabbin (1) - 10 freq dabbin (1) - 8 freq babbin (1) - 4 freq wabbin (1) - 1 freq dubbin (2) - 1 freq nabblin (2) - 1 freq swabbin (2) - 1 freq nebbin (2) - 2 freq nabbie (2) - 7 freq ribbin (2) - 2 freq jabblie (2) - 1 freq fobbin (2) - 3 freq fabbie (2) - 2 freq rabbie (2) - 65 freq mabbie (2) - 1 freq babbit (2) - 2 freq gubbin (2) - 3 freq jibblin (2) - 1 freq jandin (2) - 1 freq cabin (2) - 20 freq jappin (2) - 1 freq |
jabbin (0) - 8 freq dabbin (2) - 8 freq babbin (2) - 4 freq sabbin (2) - 10 freq wabbin (2) - 1 freq gabbin (2) - 19 freq nabbin (2) - 2 freq jabbit (2) - 3 freq jabbed (3) - 3 freq mobbin (3) - 1 freq jabble (3) - 2 freq sobbin (3) - 10 freq bebbin (3) - 1 freq dobbin (3) - 13 freq jobbie (3) - 17 freq jabberin (3) - 1 freq boabbin (3) - 1 freq rubbin (3) - 50 freq bobbin (3) - 22 freq jibbit (3) - 1 freq robbin (3) - 6 freq jobbit (3) - 5 freq jabba (3) - 1 freq ebbin (3) - 3 freq jabber (3) - 4 freq |
SoundEx code - J150 japan - 10 freq jabbin - 8 freq jaupin - 1 freq jobnny - 1 freq jeavin - 1 freq jowpin - 1 freq jovian - 3 freq juppen - 4 freq japanee - 7 freq javan - 4 freq jaw-bane - 1 freq jappin - 1 freq jpm - 1 freq jvooeom - 1 freq |
MetaPhone code - JBN jabbin - 8 freq gibbon - 10 freq jobnny - 1 freq giban - 1 freq jaw-bane - 1 freq |
JABBIN |
| Time to execute Levenshtein function - 0.213312 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.342577 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.030882 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.036980 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.000861 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. |