A downside of this approach is, however, that N -best lists can only capture a very small fraction of the search space.
the line optimization algorithm needs to repeatedly translate the development corpus and enlarge the candidate repositories with newly found hypotheses in order to avoid overfitting on C s and preventing the optimization procedure from stopping in a poor local optimum.