However, the computational cost of the parsing algorithm increases with the need for more expressive factorizations. Consequently, the existing most powerful parser<cite> (Koo and Collins, 2010</cite> ) is limited to third-order parts, which requires O(n 4 ) time and O(n 3 ) space.