| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| biggans (0) - 6 freq biggins (1) - 54 freq biggars (1) - 2 freq biggan (1) - 7 freq higgins (2) - 23 freq seggans (2) - 3 freq biggent (2) - 1 freq biggar (2) - 7 freq ingans (2) - 9 freq laggans (2) - 1 freq diggan (2) - 6 freq beggars (2) - 7 freq biggs (2) - 4 freq biggings (2) - 3 freq biggin (2) - 208 freq biggeens (2) - 3 freq baggan (2) - 2 freq moggans (2) - 1 freq biggers (2) - 9 freq bigging (2) - 1 freq brogans (2) - 1 freq hingan (3) - 18 freq bigake (3) - 5 freq laggan (3) - 4 freq diggin' (3) - 1 freq |
biggans (0) - 6 freq biggins (1) - 54 freq biggeens (2) - 3 freq biggan (2) - 7 freq biggars (2) - 2 freq biggin (3) - 208 freq biggings (3) - 3 freq moggans (3) - 1 freq brogans (3) - 1 freq biggs (3) - 4 freq bigging (3) - 1 freq biggers (3) - 9 freq baggan (3) - 2 freq higgins (3) - 23 freq beggars (3) - 7 freq seggans (3) - 3 freq biggent (3) - 1 freq laggans (3) - 1 freq byganes (4) - 2 freq bargains (4) - 7 freq beggers (4) - 1 freq baegins (4) - 1 freq coggins (4) - 1 freq noggins (4) - 2 freq biggeen (4) - 6 freq |
SoundEx code - B252 business - 292 freq begins - 82 freq biggins - 54 freq bogging - 2 freq begunked - 4 freq becomes - 42 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 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 - BKNS biggins - 54 freq beckons - 5 freq biggans - 6 freq byganes - 2 freq biggeens - 3 freq boggin's - 4 freq 'boggin's - 2 freq beacons - 4 freq bacon's - 1 freq bikinis - 1 freq backins - 2 freq bbcnews - 3 freq bokinÂ’s - 1 freq |
BIGGANS |
| Time to execute Levenshtein function - 0.186749 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.364746 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.027749 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.037925 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.000783 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. |