| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bastardisation (0) - 1 freq bastardization (1) - 1 freq staunardisation (4) - 8 freq standardisation (4) - 6 freq wastrenisation (4) - 1 freq assassination (5) - 6 freq bastardin (5) - 3 freq staundardisation (5) - 5 freq starvation (5) - 8 freq standardiesation (5) - 2 freq castration (5) - 1 freq standardization (5) - 1 freq standartisation (5) - 1 freq assassinations (6) - 2 freq categorisation (6) - 1 freq muster-station (6) - 1 freq destination (6) - 19 freq restoration (6) - 7 freq standardiesaetion (6) - 2 freq stervation (6) - 5 freq sanitation (6) - 4 freq adjudication (6) - 1 freq parturition (6) - 1 freq hybridisation (6) - 3 freq stairvation (6) - 1 freq |
bastardisation (0) - 1 freq bastardization (2) - 1 freq wastrenisation (6) - 1 freq staunardisation (6) - 8 freq bastardin (7) - 3 freq standardisation (7) - 6 freq bastards (8) - 33 freq standardiesation (8) - 2 freq castration (8) - 1 freq starvation (8) - 8 freq staundardisation (8) - 5 freq saturation (9) - 1 freq ulsterdivision (9) - 7 freq stairvation (9) - 1 freq hybridisation (9) - 3 freq bastard's (9) - 1 freq centralisation (9) - 1 freq abstraction (9) - 3 freq obstruction (9) - 1 freq distreibution (9) - 1 freq stardust (9) - 1 freq distribution (9) - 5 freq basturds (9) - 1 freq muster-station (9) - 1 freq alastairdalton (9) - 1 freq |
SoundEx code - B236 besturt - 1 freq bastarn - 16 freq bastart - 67 freq bastard - 102 freq basturt - 17 freq backdrop - 3 freq bastardin - 3 freq basturts - 4 freq bastert - 9 freq bastards - 33 freq 'bastard - 1 freq bastard' - 1 freq bastart's - 3 freq 'bastart - 1 freq bowster - 12 freq baxter - 16 freq booster - 3 freq back-treckit - 1 freq bastarts - 24 freq boisterous - 3 freq backstroke - 2 freq bigotry - 9 freq backstreets - 1 freq bastard's - 1 freq bestirs - 2 freq bus-drivers - 2 freq basturds - 1 freq basturd - 2 freq bacteria - 4 freq backdoor - 2 freq boys-a-dear - 1 freq bestrides - 1 freq 'bastart' - 1 freq 'backstairs - 1 freq buster - 2 freq back-door - 2 freq beukstores - 2 freq bestrewed - 1 freq baxters - 4 freq baxter's - 6 freq back-stair - 1 freq backthrawn - 1 freq box-trap - 2 freq bistro - 1 freq bowsters - 2 freq bowsterous - 2 freq bastirt - 1 freq bastirts - 1 freq backwater - 1 freq bousterous - 1 freq bouster - 1 freq backdoors - 1 freq busters - 1 freq bestiary - 1 freq bacterium - 1 freq backstreet - 1 freq €˜bastardised - 1 freq biscuit-ersed - 1 freq €˜bastart - 1 freq backdrap - 1 freq back-sitter - 1 freq backdraps - 2 freq €œbastart - 1 freq bastardisation - 1 freq bastern - 2 freq back-draw - 1 freq backtracked - 1 freq bowsterously - 1 freq bixter - 1 freq backwatter - 1 freq bbcthearchers - 1 freq boysadear - 1 freq bocktherobber - 1 freq bastardization - 1 freq bbcweather - 3 freq bbcwthrwatchers - 1 freq backdoorboris - 1 freq bastard” - 1 freq bacteriologist - 1 freq bbctravelscot - 1 freq bigder - 7 freq |
MetaPhone code - BSTRTSXN bastardisation - 1 freq bastardization - 1 freq |
BASTARDISATION |
| Time to execute Levenshtein function - 0.248452 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.418673 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.031476 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.037504 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. |