In addition, different parse trees of the same substring typically lead to different point estimations of the subtype vector at the root nonterminal.
cVGs cannot use dynamic programming for inference and hence have to resort to greedy search or beam search.