| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| becomes (0) - 44 freq become (1) - 197 freq becoman (2) - 2 freq became (2) - 134 freq becumms (2) - 1 freq genomes (2) - 1 freq comes (2) - 962 freq behoves (2) - 1 freq betymes (2) - 6 freq upcomes (2) - 1 freq betimes (2) - 16 freq becums (2) - 9 freq welcomes (2) - 4 freq becom (2) - 1 freq besoms (2) - 2 freq becomin (2) - 45 freq becos (2) - 1 freq baecome (2) - 6 freq incomes (2) - 1 freq belches (3) - 1 freq kemes (3) - 1 freq beckoned (3) - 4 freq newcomer (3) - 5 freq belies (3) - 1 freq eesome (3) - 2 freq |
becomes (0) - 44 freq becums (2) - 9 freq become (2) - 197 freq becom (3) - 1 freq besoms (3) - 2 freq becos (3) - 1 freq baecome (3) - 6 freq betimes (3) - 16 freq becomin (3) - 45 freq incomes (3) - 1 freq becumms (3) - 1 freq upcomes (3) - 1 freq comes (3) - 962 freq became (3) - 134 freq betymes (3) - 6 freq becoman (3) - 2 freq oncoms (4) - 1 freq outcomes (4) - 2 freq becis (4) - 40 freq beacons (4) - 4 freq boccies (4) - 1 freq becase (4) - 15 freq beciss (4) - 1 freq ootcomes (4) - 9 freq becumm (4) - 1 freq |
SoundEx code - B252 business - 295 freq begins - 83 freq biggins - 54 freq bogging - 2 freq begunked - 4 freq becomes - 44 freq businessman - 11 freq business-fowk - 1 freq businesslike - 1 freq bees-knees - 2 freq big-yins - 2 freq begunkit - 8 freq bosons - 1 freq beckons - 5 freq biggans - 6 freq buzzing - 11 freq biggings - 3 freq buchan's - 2 freq byganes - 2 freq bisniss - 4 freq begin's - 1 freq buchanness - 2 freq bisoms - 1 freq bigone's - 1 freq begunk - 18 freq bashans - 1 freq buzness - 7 freq bookings - 2 freq boak-makkin - 3 freq businesses - 19 freq 'business - 1 freq businessforscotland - 2 freq businessmen - 3 freq bisoms- - 1 freq baegins - 1 freq becums - 9 freq booking - 5 freq buckingham - 4 freq bïzness - 2 freq busineass - 1 freq beisnes - 5 freq bisness - 3 freq biggeens - 3 freq bisnesg - 1 freq boggin's - 4 freq 'boggin's - 2 freq beacons - 4 freq bigsiniss - 1 freq beseems - 1 freq busens - 1 freq bizzness - 1 freq beijing - 1 freq baking - 9 freq backing - 3 freq bygang - 1 freq besoms - 2 freq becumms - 1 freq bacon's - 1 freq beisines - 5 freq basins - 1 freq biggin-site - 1 freq beisnessis - 1 freq beisenes - 2 freq €œbusiness - 1 freq bosniak - 1 freq begunks - 2 freq boaking - 1 freq beeching - 1 freq bazonga - 1 freq bikinis - 1 freq beezing - 1 freq backins - 2 freq boking - 1 freq business-like - 2 freq businesslik - 1 freq business-lik - 1 freq buisness - 1 freq bbcnews - 3 freq beaujangles - 1 freq bossing - 2 freq bbcnewsline - 1 freq basking - 1 freq bazmcalister - 1 freq biking - 2 freq beckyannshaw - 4 freq buchanstrypes - 1 freq bbcmicrobot - 1 freq bigging - 1 freq boÂ’shunky - 1 freq bbcjamescook - 2 freq bqmzj - 1 freq beejaymcgee - 1 freq beijingpalmer - 1 freq busking - 1 freq bokinÂ’s - 1 freq bbcnewsnight - 1 freq boxing - 4 freq bissness - 1 freq bissniss - 1 freq bfgmoezk - 1 freq be-gunked - 1 freq |
MetaPhone code - BKMS becomes - 44 freq becums - 9 freq becumms - 1 freq |
BECOMES 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.178300 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.336731 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.028907 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.037945 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.000981 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. |