, Sj k on the same path in a full parsing tree, only one argument can be assigned to an argument type.
at least k − 1 arguments will be null, which is represented by φ in the following linear equality: Within the same sentence, A0-A5 cannot appear more than once.