The parsing formalism we use is related to the tree adjoining grammar (TAG) formalisms described in (Chiang, 2003;Shen and Joshi, 2005).
an important difference of our work from this previous work is that our formalism is defined to be "splittable", allowing use of the efficient parsing algorithms of Eisner (2000).