To this end, we propose tree approximation to obtain CCG sub-graphs under the factorization using tree parsing algorithms.
we introduce an algorithm to associate every graph with a projective dependency tree, which we call weighted conversion.