| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blooming (0) - 33 freq bloomin (1) - 28 freq booming (1) - 1 freq looming (1) - 3 freq bloomin' (1) - 2 freq flooding (2) - 2 freq sloomin (2) - 1 freq blowing (2) - 2 freq blaming (2) - 4 freq 'looking (2) - 1 freq gloaming (2) - 4 freq booking (2) - 5 freq boomin (2) - 14 freq becoming (2) - 9 freq zooming (2) - 1 freq boomins (2) - 1 freq looping (2) - 1 freq blooman (2) - 8 freq looking (2) - 160 freq blocking (2) - 4 freq blossoming (2) - 1 freq sooming (2) - 2 freq loomin (2) - 9 freq booting (2) - 2 freq drooning (3) - 1 freq |
blooming (0) - 33 freq bloomin' (2) - 2 freq looming (2) - 3 freq blaming (2) - 4 freq booming (2) - 1 freq bloomin (2) - 28 freq blooman (3) - 8 freq becoming (3) - 9 freq gloaming (3) - 4 freq blowing (3) - 2 freq blumin (4) - 1 freq bluimin (4) - 1 freq claiming (4) - 7 freq blawing (4) - 3 freq bling (4) - 3 freq flaming (4) - 3 freq blaaing (4) - 1 freq gleaming (4) - 2 freq blazing (4) - 2 freq bleeding (4) - 1 freq bloomeen (4) - 1 freq blaring (4) - 2 freq bleezing (4) - 3 freq fleming (4) - 46 freq beaming (4) - 2 freq |
SoundEx code - B455 blamin - 6 freq beelin-eened - 2 freq bloomin - 28 freq blumin - 1 freq bluimin - 1 freq baal-hamon - 1 freq belnamore - 3 freq blinnin - 1 freq belmont - 6 freq blinninly - 2 freq bellymoney - 2 freq bellamaina - 2 freq blooman - 8 freq bellement - 3 freq bloomeen - 1 freq ballymena - 6 freq blaming - 4 freq bioluminescent - 1 freq bull-man - 1 freq blimmin - 2 freq blooming - 33 freq bloomin' - 2 freq ballynahinch - 1 freq blumenthal - 1 freq ballymenabap - 1 freq belmontedinbur - 4 freq billyneymates - 1 freq ballamena - 1 freq |
MetaPhone code - BLMNK blaming - 4 freq blooming - 33 freq |
BLOOMING |
| Time to execute Levenshtein function - 0.362192 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.629114 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.039479 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.076530 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.000795 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. |