| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buggert (0) - 3 freq buggery (1) - 10 freq buggers (1) - 31 freq bugger (1) - 141 freq buttert (2) - 7 freq buggerin (2) - 3 freq beggery (2) - 1 freq suggest (2) - 46 freq rugger (2) - 2 freq burger (2) - 13 freq buggered (2) - 13 freq burgers (2) - 11 freq anggert (2) - 1 freq buggar (2) - 1 freq biggent (2) - 1 freq bigger' (2) - 1 freq biggest (2) - 137 freq hungert (2) - 39 freq buggeraa (2) - 1 freq taggert (2) - 1 freq bigget (2) - 1 freq 'bugger (2) - 2 freq ungert (2) - 1 freq budget (2) - 31 freq puggelt (2) - 2 freq |
buggert (0) - 3 freq buggers (2) - 31 freq bugger (2) - 141 freq buggery (2) - 10 freq buggeraa (3) - 1 freq bigger' (3) - 1 freq biggent (3) - 1 freq taggert (3) - 1 freq beggers (3) - 1 freq biggers (3) - 9 freq bigger (3) - 229 freq buggar (3) - 1 freq bigget (3) - 1 freq biggest (3) - 137 freq beggery (3) - 1 freq anggert (3) - 1 freq buggered (3) - 13 freq buggerin (3) - 3 freq beggars (4) - 7 freq braggart (4) - 2 freq bogart (4) - 1 freq biggit (4) - 244 freq biggist (4) - 2 freq taggart (4) - 4 freq biggars (4) - 2 freq |
SoundEx code - B263 backartywise - 1 freq bigger-that - 1 freq backwarts - 3 freq backward - 11 freq backarties - 3 freq backroad - 1 freq backwards - 35 freq begrudge - 2 freq backarts - 10 freq 'backarts' - 1 freq baukward-luikin - 1 freq buggered - 13 freq backyard - 1 freq bakward - 2 freq bakwards - 2 freq backwart - 7 freq box-cairt - 1 freq 'backwards - 1 freq begrutten - 6 freq bacardi - 8 freq baakwardly - 1 freq buzzard - 3 freq buggert - 3 freq backgairden - 1 freq beckairts - 1 freq buzzards - 5 freq backarty-wise' - 1 freq backarty-wise - 1 freq bogart - 1 freq backerties - 1 freq bickered - 1 freq 'backwards' - 1 freq backwirds - 2 freq bjartalid - 1 freq 'backwarts' - 1 freq bizzard - 1 freq bickert - 3 freq bakwarts - 1 freq bussard - 1 freq €˜begrutten - 1 freq backairts - 1 freq buggeration - 1 freq buchart - 1 freq backward-turnt - 1 freq begrudged - 1 freq begrudgin - 1 freq baegered - 1 freq backgarden - 1 freq bbcradioscot - 27 freq bbcradioulster - 13 freq bbcradiofoyle - 1 freq boxertoye - 1 freq backroadbiking - 1 freq bbcradio - 5 freq bbcradiowales - 1 freq bbcradiodrama - 1 freq backward- - 1 freq biggardenbirdwatch - 1 freq bigredfcassidy - 1 freq bsgcreativesig - 2 freq bbcearth - 1 freq |
MetaPhone code - BKRT backroad - 1 freq buggered - 13 freq bacardi - 8 freq buggert - 3 freq bogart - 1 freq bickered - 1 freq bickert - 3 freq bbcradio - 5 freq |
BUGGERT |
| Time to execute Levenshtein function - 0.203584 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.348092 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.030077 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.039459 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.000807 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. |