A number of authors have provided polynomial time algorithms for parsing with CCG which gives some insight into how good our bound of O(n 5 ) is.
vijay-Shanker and Weir (1994) provided a chart parsing algorithm for CCG with a time bound of O(n 6 ).