| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| becomin (0) - 45 freq becumin (1) - 1 freq becoming (1) - 9 freq becoman (1) - 2 freq besoin (2) - 1 freq 'comin (2) - 3 freq reconin (2) - 1 freq beamin (2) - 26 freq beemin (2) - 1 freq become (2) - 197 freq comin (2) - 1066 freq becomes (2) - 44 freq bedouin (2) - 1 freq bloomin (2) - 28 freq oncomin (2) - 4 freq becom (2) - 1 freq boomin (2) - 15 freq becin (2) - 1 freq beckonin (2) - 3 freq upcomin (2) - 3 freq welcomin (2) - 8 freq incomin (2) - 7 freq eomin (2) - 1 freq breemin (3) - 1 freq resumin (3) - 1 freq |
becomin (0) - 45 freq becoman (1) - 2 freq becumin (1) - 1 freq becoming (2) - 9 freq oncomin (3) - 4 freq bloomin (3) - 28 freq becom (3) - 1 freq incomin (3) - 7 freq becomes (3) - 44 freq upcomin (3) - 3 freq becin (3) - 1 freq boomin (3) - 15 freq beamin (3) - 26 freq 'comin (3) - 3 freq beemin (3) - 1 freq become (3) - 197 freq comin (3) - 1066 freq becumm (4) - 1 freq comon (4) - 1 freq camin (4) - 4 freq bachin (4) - 2 freq bycommon (4) - 2 freq bemoan (4) - 1 freq bummin (4) - 20 freq 'coman (4) - 1 freq |
SoundEx code - B255 beginnin - 70 freq becomin - 45 freq basement - 9 freq bazement - 1 freq back-comin - 1 freq beginning - 21 freq bogeyman - 2 freq becoming - 9 freq beckonin - 3 freq buchanan - 32 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 - BKMN becomin - 45 freq becoman - 2 freq bycommon - 2 freq backmen - 1 freq becumin - 1 freq bukeman - 1 freq |
BECOMIN become - 197 freq became - 134 freq becam - 97 freq becomes - 44 freq becomin - 45 freq becoming - 9 freq becoman - 2 freq |
| Time to execute Levenshtein function - 0.192557 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.364705 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.028608 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.038698 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.000964 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. |