| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blaming (0) - 4 freq blaaing (1) - 1 freq blazing (1) - 2 freq blamin (1) - 6 freq blaring (1) - 2 freq flaming (1) - 4 freq blawing (1) - 3 freq bla'ing (1) - 1 freq beaming (1) - 2 freq clamin (2) - 1 freq baking (2) - 9 freq claping (2) - 1 freq aming (2) - 3 freq booming (2) - 2 freq fleming (2) - 46 freq beating (2) - 7 freq blowing (2) - 2 freq boaking (2) - 1 freq baling (2) - 1 freq bearing (2) - 6 freq naming (2) - 2 freq blaain (2) - 22 freq blaein (2) - 1 freq blooming (2) - 33 freq bumming (2) - 2 freq |
blaming (0) - 4 freq blawing (2) - 3 freq bla'ing (2) - 1 freq flaming (2) - 4 freq blooming (2) - 33 freq beaming (2) - 2 freq blaring (2) - 2 freq blaaing (2) - 1 freq blazing (2) - 2 freq blamin (2) - 6 freq blumin (3) - 1 freq gloaming (3) - 5 freq claiming (3) - 7 freq flamingo (3) - 31 freq baling (3) - 1 freq bling (3) - 3 freq bumming (3) - 2 freq fleming (3) - 46 freq gleaming (3) - 2 freq blowing (3) - 2 freq booming (3) - 2 freq blain (4) - 2 freq bullying (4) - 4 freq flaking (4) - 1 freq shaming (4) - 1 freq |
SoundEx code - B455 blamin - 6 freq beelin-eened - 2 freq bloomin - 28 freq blumin - 1 freq bluimin - 1 freq baal-hamon - 1 freq blimmin - 4 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 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 |
BLAMING |
| Time to execute Levenshtein function - 0.190879 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.361581 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.030274 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.038213 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.000933 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. |