Once we have fixed a specific element of this table, the maximization steps can be done in 1)).
the complexity of this algorithm is in setting k = 0 results in a search algorithm that is monotone at the phrase level.