The O(n 3 ) split-head grammar is closely related to the O(n 3 ) PBDG parsing algorithm given by Eisner and Satta (1999).
the steps involved in parsing with this grammar using the CKY algorithm are essentially the same as those performed by the Eisner/Satta algorithm.