| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bulb (0) - 11 freq bul (1) - 3 freq bulbs (1) - 8 freq bul' (1) - 1 freq bulk (1) - 8 freq buls (1) - 1 freq bull (1) - 92 freq bukb (1) - 1 freq uob (2) - 1 freq ould (2) - 21 freq buzz (2) - 23 freq buys (2) - 13 freq lulz (2) - 1 freq bunt (2) - 6 freq buyy (2) - 1 freq bug (2) - 57 freq burd (2) - 91 freq bulls (2) - 11 freq sulk (2) - 4 freq bl (2) - 2 freq built (2) - 123 freq blurb (2) - 1 freq bouls (2) - 2 freq bald (2) - 18 freq bauld (2) - 38 freq |
bulb (0) - 11 freq bukb (2) - 1 freq blub (2) - 1 freq blob (2) - 4 freq bull (2) - 92 freq blab (2) - 3 freq buls (2) - 1 freq bulbs (2) - 8 freq bul (2) - 3 freq bul' (2) - 1 freq bulk (2) - 8 freq bxb (3) - 1 freq baulm (3) - 1 freq balm (3) - 6 freq bylt (3) - 7 freq bill (3) - 551 freq bob (3) - 214 freq blk (3) - 1 freq lb (3) - 4 freq bld (3) - 1 freq blm (3) - 1 freq bela (3) - 1 freq bil (3) - 1 freq bulge (3) - 4 freq balr (3) - 1 freq |
SoundEx code - B410 believe - 600 freq bellpou - 1 freq belyve - 33 freq bluff - 4 freq 'believe - 3 freq bulb - 11 freq belief - 61 freq blip - 5 freq blyave - 2 freq blab - 3 freq bileeve - 4 freq bileev - 5 freq bleep - 2 freq blub - 1 freq behalf - 18 freq belive - 2 freq blype - 1 freq beleive - 1 freq baelieve - 6 freq bealieve - 1 freq bailiff - 5 freq blob - 4 freq belly-up - 2 freq boolfu - 1 freq beleiff - 1 freq bolivia - 2 freq blaff - 2 freq bulfie - 1 freq bellyfou - 1 freq balefu - 2 freq beleve - 6 freq €œbeleve - 1 freq bellyfu - 1 freq boleivia - 1 freq bowlfae - 1 freq bowelfae - 1 freq €œbelieve - 2 freq blow-up - 1 freq balboa - 1 freq balf - 1 freq bilbao - 3 freq ballboy - 2 freq baleev - 1 freq bowlfu - 1 freq beleeve - 5 freq belf - 3 freq |
MetaPhone code - BLB bulb - 11 freq blab - 3 freq blub - 1 freq blob - 4 freq balboa - 1 freq bilbao - 3 freq ballboy - 2 freq |
BULB |
| Time to execute Levenshtein function - 0.244717 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.448696 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.031620 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.037636 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.000880 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. |