In the preceding discussion, we have shown that natural language dependency parsing can be reduced to finding maximum spanning trees in directed graphs.
we performed experiments on the Czech Prague Dependency Treebank (PDT) (Hajič, 1998;Hajič et al., 2001).