| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jibblin (0) - 1 freq dibblin (1) - 1 freq nibblin (1) - 7 freq bibblin (1) - 2 freq jigglin (2) - 5 freq siblin (2) - 1 freq babblin (2) - 2 freq nibbling (2) - 4 freq dribblin (2) - 5 freq gabblin (2) - 4 freq birblin (2) - 1 freq gobblin (2) - 1 freq wobblin (2) - 3 freq ribbin (2) - 2 freq jinglin (2) - 11 freq nibblan (2) - 4 freq mbblin (2) - 1 freq jabblie (2) - 1 freq tribblin (2) - 1 freq nabblin (2) - 1 freq hobblin (2) - 2 freq jabbin (2) - 7 freq jibbled (2) - 1 freq bubblin (2) - 29 freq jibble (2) - 4 freq |
jibblin (0) - 1 freq bibblin (2) - 2 freq dibblin (2) - 1 freq nibblin (2) - 7 freq hobblin (3) - 2 freq nabblin (3) - 1 freq mbblin (3) - 1 freq jabbin (3) - 7 freq jabblie (3) - 1 freq yabblin (3) - 2 freq jibbles (3) - 1 freq wabblin (3) - 5 freq nibblan (3) - 4 freq jibble (3) - 4 freq jibbled (3) - 1 freq bubblin (3) - 29 freq babblin (3) - 2 freq gabblin (3) - 4 freq wobblin (3) - 3 freq gobblin (3) - 1 freq jinglin (4) - 11 freq siblin (4) - 1 freq bubblen (4) - 1 freq jabble (4) - 2 freq jabberin (4) - 1 freq |
SoundEx code - J145 javelins - 4 freq jufflin - 1 freq jubilant - 2 freq jibblin - 1 freq javelin - 1 freq |
MetaPhone code - JBLN jibblin - 1 freq |
JIBBLIN |
| Time to execute Levenshtein function - 0.230880 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.357081 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.028047 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.043766 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.000821 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. |