In this paper, we focus on binary SCFGs and without loss of generality assume that only the preterminal unary rules can generate terminal string pairs.
we are focusing on Inversion Transduction Grammars (Wu, 1997) which are an important subclass of SCFG.