| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jibble (0) - 4 freq jibbles (1) - 1 freq jabble (1) - 2 freq dibble (1) - 1 freq kibble (1) - 1 freq nibble (1) - 8 freq gibble (1) - 1 freq tibble (1) - 18 freq sibble (1) - 1 freq jibbled (1) - 1 freq yibble (1) - 3 freq libbie (2) - 1 freq stibble (2) - 14 freq bubble (2) - 37 freq hibbled (2) - 1 freq jile (2) - 42 freq gibblet (2) - 1 freq viable (2) - 11 freq bible (2) - 95 freq pebble (2) - 9 freq rabble (2) - 10 freq dibbled (2) - 1 freq aible (2) - 2 freq dabble (2) - 2 freq nibblt (2) - 1 freq |
jibble (0) - 4 freq jabble (1) - 2 freq jibbled (2) - 1 freq yibble (2) - 3 freq jabblie (2) - 1 freq tibble (2) - 18 freq sibble (2) - 1 freq dibble (2) - 1 freq gibble (2) - 1 freq kibble (2) - 1 freq jibbles (2) - 1 freq nibble (2) - 8 freq bobble (3) - 1 freq habble (3) - 2 freq dubble (3) - 2 freq cobble (3) - 5 freq ebble (3) - 1 freq jobbie (3) - 17 freq jibbed (3) - 1 freq yabble (3) - 1 freq jibblin (3) - 1 freq wobble (3) - 2 freq wabble (3) - 3 freq rubble (3) - 7 freq pebble (3) - 9 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 |
JIBBLE |
| Time to execute Levenshtein function - 0.267974 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.446477 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.029512 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.041534 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.001041 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. |