| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tibble (0) - 18 freq dibble (1) - 1 freq jibble (1) - 4 freq stibble (1) - 14 freq sibble (1) - 1 freq nibble (1) - 8 freq tibbie (1) - 10 freq yibble (1) - 3 freq kibble (1) - 1 freq gibble (1) - 1 freq tribble (1) - 31 freq rabble (2) - 10 freq tingle (2) - 5 freq timmle (2) - 4 freq dabble (2) - 2 freq treble (2) - 9 freq jibbles (2) - 1 freq tibby (2) - 16 freq wimble (2) - 1 freq tabbie (2) - 1 freq gibbles (2) - 1 freq hibbled (2) - 1 freq nimble (2) - 1 freq tiddle (2) - 1 freq bobble (2) - 1 freq |
tibble (0) - 18 freq yibble (2) - 3 freq kibble (2) - 1 freq tribble (2) - 31 freq tibbie (2) - 10 freq gibble (2) - 1 freq nibble (2) - 8 freq dibble (2) - 1 freq jibble (2) - 4 freq sibble (2) - 1 freq stibble (2) - 14 freq table (3) - 686 freq yabble (3) - 1 freq jabble (3) - 2 freq habble (3) - 2 freq dubble (3) - 2 freq wobble (3) - 2 freq stubble (3) - 13 freq babble (3) - 2 freq hubble (3) - 3 freq bible (3) - 95 freq gabble (3) - 1 freq ebble (3) - 1 freq tumble (3) - 9 freq taeble (3) - 3 freq |
SoundEx code - T140 table - 686 freq tipple - 3 freq twa-fal - 1 freq twa-faul - 1 freq tebel - 1 freq taible - 2 freq topple - 1 freq tibble - 18 freq tivoli - 5 freq teeble - 6 freq taibil - 3 freq taeble - 3 freq t'boyl - 1 freq the-ablow - 2 freq tap'll - 1 freq tfel - 1 freq tyfbl - 1 freq table' - 1 freq tvl - 1 freq tbl - 1 freq |
MetaPhone code - TBL table - 686 freq double - 129 freq dooble - 26 freq doubly - 4 freq 'double - 3 freq tebel - 1 freq dubble - 2 freq taible - 2 freq doughball - 1 freq dibble - 1 freq tibble - 18 freq dabble - 2 freq doubil - 3 freq teeble - 6 freq taibil - 3 freq taeble - 3 freq t'boyl - 1 freq €˜double - 2 freq €œdouble - 1 freq table' - 1 freq deeable - 1 freq tbl - 1 freq |
TIBBLE |
| Time to execute Levenshtein function - 0.367755 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.610755 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.061319 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.038079 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.000866 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. |