| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| becoming (0) - 9 freq becomin (1) - 45 freq incoming (2) - 1 freq welcoming (2) - 3 freq beckoning (2) - 1 freq booming (2) - 1 freq upcoming (2) - 3 freq beaming (2) - 2 freq coming (2) - 116 freq acoming (2) - 1 freq becumin (2) - 1 freq becoman (2) - 2 freq blooming (2) - 33 freq betting (3) - 2 freq coing (3) - 1 freq boeing (3) - 1 freq beckonin (3) - 3 freq fechting (3) - 2 freq daoming (3) - 1 freq seeming (3) - 1 freq bloomin (3) - 28 freq beating (3) - 7 freq bending (3) - 2 freq blaming (3) - 4 freq fecking (3) - 4 freq |
becoming (0) - 9 freq becomin (2) - 45 freq acoming (3) - 1 freq becumin (3) - 1 freq blooming (3) - 33 freq coming (3) - 116 freq becoman (3) - 2 freq beaming (3) - 2 freq booming (3) - 1 freq upcoming (3) - 3 freq incoming (3) - 1 freq backing (4) - 3 freq bumming (4) - 2 freq blaming (4) - 4 freq cuming (4) - 1 freq beeching (4) - 1 freq welcoming (4) - 3 freq beckoning (4) - 1 freq comins (5) - 4 freq beilding (5) - 2 freq becom (5) - 1 freq teaming (5) - 1 freq decking (5) - 1 freq bloomin' (5) - 2 freq being (5) - 296 freq |
SoundEx code - B255 beginnin - 70 freq becomin - 45 freq basement - 9 freq bazement - 1 freq back-comin - 1 freq beginning - 18 freq bogeyman - 2 freq becoming - 9 freq beckonin - 3 freq buchanan - 33 freq beginnin' - 1 freq beginnins - 6 freq beckoning - 1 freq baeginnin - 3 freq buchanan's - 5 freq begïnnin - 1 freq begennin - 6 freq boss-man - 2 freq becoman - 2 freq beginin - 15 freq bycommon - 2 freq beginnan - 11 freq begineen - 3 freq backmen - 1 freq becumin - 1 freq bukeman - 1 freq bosnian - 1 freq busman's - 1 freq buchanienews - 1 freq bigmonsterlove - 3 freq beginneen - 1 freq |
MetaPhone code - BKMNK becoming - 9 freq |
BECOMING |
| Time to execute Levenshtein function - 0.216089 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.382136 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.027329 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.037187 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.000805 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. |