@article{kuhlmann-satta-2014-new,
    title = "A New Parsing Algorithm for {C}ombinatory {C}ategorial {G}rammar",
    author = "Kuhlmann, Marco  and
      Satta, Giorgio",
    editor = "Lin, Dekang  and
      Collins, Michael  and
      Lee, Lillian",
    journal = "Transactions of the Association for Computational Linguistics",
    volume = "2",
    year = "2014",
    address = "Cambridge, MA",
    publisher = "MIT Press",
    url = "https://preview.aclanthology.org/moar-dois/Q14-1032/",
    doi = "10.1162/tacl_a_00192",
    pages = "405--418",
    abstract = "We present a polynomial-time parsing algorithm for CCG, based on a new decomposition of derivations into small, shareable parts. Our algorithm has the same asymptotic complexity, O(n6), as a previous algorithm by Vijay-Shanker and Weir (1993), but is easier to understand, implement, and prove correct."
}