We design our method as a pre-processing procedure so that we can use a well-developed phrasebased system without adding heavy computational complexity to the system.
we propose an abstraction tree that is a shallow and nested representation, i.e., abstraction of the dependency tree as Fig.