next up previous
Next: Dependency relations Up: Disambiguation Previous: Disambiguation

Penalty rules.

The simplest disambiguation method consists of hand-written `penalty' rules which implement a variety of preferences. Each such penalty rule describes a partial parse tree. For a given parse tree, the system computes how often a sub-tree matches with a penalty rule, giving rise to the total penalty of that parse. The following lists characterizes some of the penalty rules:

As can be concluded from the preliminary results presented in table 3, it appears to be the case that about 60% of the disambiguation problem can be solved using this very simple technique.

Noord G.J.M. van