This indicates that the focus on algorithms that guarantee well-formed trees is justified.
3 Experiments The most common approach for combining independently-trained models at parsing time is to assign each candidate dependency a score based on the number of votes it received from the base parsers.