| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bubbly-jock (0) - 7 freq bubblyjock (1) - 8 freq bubblyjocks (2) - 4 freq bubblejock (2) - 1 freq bubbliejok (3) - 1 freq bubbly-jockies (3) - 1 freq 'bubblyjock' (3) - 1 freq bubblie-joks (4) - 1 freq bubbly (5) - 10 freq unblock (5) - 3 freq bubble-thin (5) - 1 freq bullock (5) - 3 freq bubblyjockitis (5) - 1 freq bubbly' (5) - 1 freq bellyknock (5) - 1 freq subjeck (6) - 80 freq bull-thick (6) - 1 freq 'bubbly (6) - 1 freq publick (6) - 20 freq babby-the (6) - 1 freq barlornock (6) - 1 freq block (6) - 55 freq balornock (6) - 1 freq unblocks (6) - 1 freq bullocks (6) - 2 freq |
bubbly-jock (0) - 7 freq bubblyjock (2) - 8 freq bubblejock (3) - 1 freq bubbly-jockies (4) - 1 freq bubblyjocks (4) - 4 freq bubbliejok (5) - 1 freq bubblie-joks (6) - 1 freq 'bubblyjock' (6) - 1 freq bubble-thin (8) - 1 freq bubblyjockitis (8) - 1 freq bellyknock (9) - 1 freq blu-tack (9) - 1 freq bubbly' (9) - 1 freq unblock (9) - 3 freq bubbly (9) - 10 freq bullock (9) - 3 freq bubbled (10) - 10 freq bubbaloo (10) - 2 freq bubblen (10) - 1 freq lumberjack (10) - 1 freq bubble (10) - 30 freq bubblin (10) - 29 freq bubblan (10) - 2 freq bubbling (10) - 1 freq ball-cocks (10) - 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 - BBLJK bubbly-jock - 7 freq bubblyjock - 8 freq bubbliejok - 1 freq bubblejock - 1 freq 'bubblyjock' - 1 freq |
BUBBLY-JOCK |
| Time to execute Levenshtein function - 0.205983 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.384753 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.028064 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.036729 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.000831 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. |