As mentioned in Section 2, there is a limited number of idiosyncratic correspondences between elements of SSyntS and DSyntS (the correspondences (iv-vii) which can be straightforwardly handled by a rule-based postprocessor because (a) they are non-ambiguous, i.e., a ↔ b, c ↔ d ⇒ a = b ∧ c = d, and (b) they are few.
only determiners and auxiliaries in SSyntS map onto a grammeme in DSyntS, both SSyntS and DSyntS count with less than a dozen grammemes, etc.