| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bibbles (0) - 1 freq sibbles (1) - 1 freq bibles (1) - 6 freq bobbles (1) - 1 freq bubbles (1) - 24 freq nibbles (1) - 2 freq jibbles (1) - 1 freq gibbles (1) - 1 freq jibbled (2) - 1 freq bible (2) - 95 freq nibble (2) - 8 freq dibbled (2) - 1 freq nibbies (2) - 1 freq birples (2) - 1 freq bobbler (2) - 3 freq dibble (2) - 1 freq cobbles (2) - 10 freq gibble (2) - 1 freq sibble (2) - 1 freq mibbies (2) - 18 freq gibblet (2) - 1 freq tibble (2) - 18 freq bubblen (2) - 1 freq bubbled (2) - 10 freq yibble (2) - 3 freq |
bibbles (0) - 1 freq bubbles (1) - 24 freq bobbles (1) - 1 freq gibbles (2) - 1 freq jibbles (2) - 1 freq bobblies (2) - 1 freq nibbles (2) - 2 freq sibbles (2) - 1 freq bibles (2) - 6 freq bubblen (3) - 1 freq baubles (3) - 7 freq bubbled (3) - 10 freq babbies (3) - 13 freq bubble's (3) - 2 freq bubble (3) - 37 freq bumbles (3) - 1 freq bobble (3) - 1 freq bibblin (3) - 2 freq bobbies (3) - 33 freq hobbles (3) - 2 freq pebbles (3) - 8 freq wabbles (3) - 1 freq babbled (3) - 2 freq wobbles (3) - 1 freq cobbles (3) - 10 freq |
SoundEx code - B142 bubbly-jock - 7 freq bubbles - 24 freq bibles - 6 freq biblical - 12 freq baubles - 7 freq bobblies - 1 freq bubble's - 2 freq bibliography' - 1 freq bubblyjockitis - 1 freq bubblyjock-and-aipple - 1 freq bubblyjocks - 4 freq bubblyjock - 8 freq bibliography - 3 freq babel's - 1 freq buffaloes - 1 freq bubblie-joks - 1 freq bubbliejok - 1 freq by-place - 1 freq bibbles - 1 freq bevels - 1 freq bubblejock - 1 freq bibliocentrism - 1 freq bubbly-jockies - 1 freq bobbles - 1 freq baffles - 1 freq 'bubblyjock' - 1 freq |
MetaPhone code - BBLS bubbles - 24 freq bibles - 6 freq baubles - 7 freq bobblies - 1 freq bubble's - 2 freq babel's - 1 freq bibbles - 1 freq bobbles - 1 freq |
BIBBLES |
| Time to execute Levenshtein function - 0.310381 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.574764 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.068434 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.054713 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.001254 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. |