While the outlined restrictions are in principle sufficient to generate all regularisation terms up to some scheme of truncation, we decided to automate this process. The major steps of this algorithm are shown in three examples in figure . Since the calculation of all possible diagrams is inherently a combinatorial process, intermediate steps that cut down on the number of possible diagrams are effectively required to move computation time into a reasonable order of magnitude.