In formal terms that we need for the outline of the transduction below, a SSyntS is defined as follows: Definition 1 (SSyntS) An SSyntS of a language L is a quintuple T SS = N, A, λ ls→n , ρ rs→a , γ n→g defined over all lexical items L of L, the set of syntactic grammemes G synt , and the set of grammatical functions R gr , where • the set N of nodes and the set A of directed arcs form a connected tree, • λ ls→n assigns to each n ∈ N an l s ∈ L, • ρ rs→a assigns to each a ∈ A an r ∈ R gr , and The features of the node labels in DSyntSs as worked with in this paper are lex dsynt and "semantic grammemes" of the value of lex dsynt , i.e., number and determination for nouns and tense, aspect, mood and voice for verbs.
2 to lex ssynt in SSyntS, DSyntS's lex dsynt can be any full, but not a functional lexeme.