| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jabbin (0) - 7 freq wabbin (1) - 1 freq jabbit (1) - 3 freq nabbin (1) - 2 freq sabbin (1) - 10 freq dabbin (1) - 7 freq gabbin (1) - 19 freq babbin (1) - 4 freq babbit (2) - 2 freq nabbie (2) - 7 freq jattin (2) - 1 freq blabbin (2) - 1 freq jabberin (2) - 1 freq rabbit (2) - 499 freq abuin (2) - 344 freq babbie (2) - 34 freq jammin (2) - 4 freq lobbin (2) - 4 freq jaupin (2) - 1 freq jabber (2) - 4 freq boabbin (2) - 1 freq nebbin (2) - 1 freq dobbin (2) - 13 freq dubbin (2) - 1 freq swabbin (2) - 1 freq |
jabbin (0) - 7 freq dabbin (2) - 7 freq babbin (2) - 4 freq sabbin (2) - 10 freq gabbin (2) - 19 freq nabbin (2) - 2 freq jabbit (2) - 3 freq wabbin (2) - 1 freq jabba (3) - 1 freq rubbin (3) - 48 freq jabble (3) - 2 freq bebbin (3) - 1 freq jibblin (3) - 1 freq dubbin (3) - 1 freq jobbie (3) - 17 freq dobbin (3) - 13 freq bobbin (3) - 21 freq jobbit (3) - 5 freq robbin (3) - 5 freq sobbin (3) - 9 freq fobbin (3) - 3 freq nebbin (3) - 1 freq lobbin (3) - 4 freq jibbit (3) - 1 freq jabbed (3) - 3 freq |
SoundEx code - J150 japan - 10 freq jabbin - 7 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 - 7 freq gibbon - 10 freq jobnny - 1 freq giban - 1 freq jaw-bane - 1 freq |
JABBIN |
| Time to execute Levenshtein function - 0.182889 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.336324 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.042839 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.036503 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.000755 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. |