In this paper, we present a deterministic dependency structure analyzer for Chinese. This analyzer implements two algorithms – Yamada and Nivre models – and two sorts of classifiers – Support Vector Machines and Maximum Entropy methods. We compare the performance of these 2x2 combinations. We evaluate the method on a dependency tagged corpus derived from the CKIP Treebank corpus. Then, we analyzed the errors in the experiments and found that some errors were caused by mistakes of nominal compounds analysis. Therefore we adopt an NP-chunker to solve this problem.