To parse all the sentences in the PDT, one must use a non-projective parsing algorithm, which is a known NP-complete inference problem when not assuming strong independence assumptions.
the use of approximate inference techniques is common in order to find the highest weighted tree for a sentence.