While retrieving patterns, we also need to enforce that a pattern be not completely filled just by adding the target words t, as under these conditions there would be no room to achieve any kind of creative effect.
we also require that the patterns retrieved by CompatiblePatterns(•) have more empty slots than the size of t. The minimum and maximum number of excess slots in the pattern are two other meta-parameters controlled by Θ. CompatiblePatterns(•) returns compatible patterns ordered by their frequency, i.e.