| << Prev | - Up - | Next >> |
It is worth stressing the fact that constraint programming is exceptionally strong when applied to problems with a finite formulation. This was the case for dominance descriptions: each description contains a finite number of variables. It is the case again for dependency parsing: there are finitely many words in the sentence, and each one has finitely many lexical frames.
Whenever you tackle a new problem, it is a good idea to look for the parts of it that may be given a finite formulation.
| << Prev | - Up - | Next >> |