The search method commonly used in dependency parsers is a chart-based dynamic programming algorithm that finds the highest-scoring projective dependency tree under an edge-factored scoring function.
we believe that for any interesting linguistic structure, the second layer will be highly dependent on the structure of the first layer.