This can be simplified by computing arg max As we only consider assigning the number slots of the templates in T , generally, the size of the possible assignments per word problem is bearable, as shown in the Table 2.
we simply evaluate all the y ijk ∈ Y i .