@inproceedings{he-penn-2025-ccg,
    title = "{CCG} Revisited: A Multilingual Empirical Study of the {K}uhlmann-{S}atta Algorithm",
    author = "He, Paul  and
      Penn, Gerald",
    editor = "Sagae, Kenji  and
      Oepen, Stephan",
    booktitle = "Proceedings of the 18th International Conference on Parsing Technologies (IWPT, SyntaxFest 2025)",
    month = aug,
    year = "2025",
    address = "Ljubljana, Slovenia",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/mtsummit-25-ingestion/2025.iwpt-1.3/",
    pages = "20--25",
    ISBN = "979-8-89176-294-7",
    abstract = "We revisit the polynomial-time CCG parsing algorithm introduced by Kuhlmann {\&} Satta (2014), and provide a publicly available implementation of it. We evaluate its empirical performance against a naive CKY-style parser across the Parallel Meaning Bank (PMB) corpus. While the fast parser is slightly slower on average, relative to the size of the PMB, but the trend improves as a function of sentence length, and the PMB is large enough to witness an inversion. Our analysis quantifies this crossover and highlights the importance of derivational context decomposition in practical parsing scenarios."
}