| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jabblie (0) - 1 freq jabble (1) - 2 freq wabblie (1) - 1 freq tabbie (2) - 1 freq wabblin (2) - 5 freq babble (2) - 2 freq habble (2) - 2 freq yabble (2) - 1 freq gabblin (2) - 4 freq yabblin (2) - 2 freq jabbit (2) - 3 freq jobbie (2) - 17 freq jabbin (2) - 8 freq cabbie (2) - 3 freq gabbie (2) - 1 freq babbie (2) - 34 freq dabble (2) - 2 freq jibblin (2) - 1 freq mabbie (2) - 1 freq fabbie (2) - 2 freq wabble (2) - 3 freq habbie (2) - 9 freq rabble (2) - 10 freq nabblin (2) - 1 freq abbie (2) - 59 freq |
jabblie (0) - 1 freq jabble (1) - 2 freq jibble (2) - 4 freq wabblie (2) - 1 freq dabble (3) - 2 freq jabbin (3) - 8 freq jibblin (3) - 1 freq gabble (3) - 1 freq rabble (3) - 10 freq jobbie (3) - 17 freq wabble (3) - 3 freq habble (3) - 2 freq jabbit (3) - 3 freq babble (3) - 2 freq yabble (3) - 1 freq jibbles (4) - 1 freq gobble (4) - 3 freq jabber (4) - 4 freq jibbit (4) - 1 freq sibble (4) - 1 freq hubble (4) - 3 freq bubble (4) - 37 freq habbil (4) - 1 freq bobble (4) - 1 freq tibble (4) - 18 freq |
SoundEx code - J140 jabblie - 1 freq jibble - 4 freq joyfully - 1 freq jubilee - 4 freq jabble - 2 freq joyful - 2 freq javell - 1 freq jpl - 2 freq €˜joyfull - 1 freq jovial - 1 freq jpla - 1 freq |
MetaPhone code - JBL jabblie - 1 freq jibble - 4 freq jubilee - 4 freq jabble - 2 freq gibble - 1 freq |
JABBLIE |
| Time to execute Levenshtein function - 0.252741 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.406690 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.029573 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.042008 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.000960 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. |