| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bibles (0) - 6 freq bibbles (1) - 1 freq bible (1) - 93 freq biles (1) - 14 freq bille (2) - 2 freq bites (2) - 23 freq ible (2) - 1 freq idles (2) - 1 freq nibbles (2) - 2 freq billies (2) - 14 freq bides (2) - 228 freq byles (2) - 5 freq bills (2) - 18 freq nobles (2) - 7 freq fables (2) - 10 freq bogles (2) - 23 freq belles (2) - 1 freq bridles (2) - 1 freq jibes (2) - 2 freq isles (2) - 83 freq bields (2) - 13 freq aisles (2) - 3 freq files (2) - 108 freq bubbles (2) - 23 freq binges (2) - 1 freq |
bibles (0) - 6 freq baubles (2) - 5 freq biles (2) - 14 freq bible (2) - 93 freq bibbles (2) - 1 freq sibbles (3) - 1 freq babes (3) - 5 freq foibles (3) - 2 freq boles (3) - 1 freq birls (3) - 31 freq cobles (3) - 2 freq nables (3) - 1 freq bumbles (3) - 1 freq bugles (3) - 1 freq tables (3) - 83 freq cables (3) - 6 freq babies (3) - 28 freq bales (3) - 17 freq gibbles (3) - 1 freq ambles (3) - 2 freq bobbles (3) - 1 freq gables (3) - 4 freq paibles (3) - 1 freq jibbles (3) - 1 freq billys (3) - 1 freq |
SoundEx code - B142 bubbly-jock - 7 freq bubbles - 23 freq bibles - 6 freq biblical - 12 freq bubble's - 2 freq baubles - 5 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 - 23 freq bibles - 6 freq bubble's - 2 freq baubles - 5 freq babel's - 1 freq bibbles - 1 freq bobbles - 1 freq |
BIBLES |
| Time to execute Levenshtein function - 0.244957 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.383442 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.030219 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.036679 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.000813 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. |