In this paper, we compare a higher order graph-based parser and a transition-based parser with beam search. These parsers provide a higher accuracy than a second order MST parser and a deterministic transition-based parser. We apply and compare the output on languages, which have not been in the research focus of Shared Tasks. The parser are implemented in a uniform framework. The transition-based parser was newley implemented and we revised the graph-based parser. The graph-based parser has to our knowlege the highest published scores for French and Czech with 90.40 and 81.43 labeled accuracy score.