no code implementations • CL (ACL) 2022 • Lena Katharina Schiffer, Marco Kuhlmann, Giorgio Satta
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be parsed in polynomial time when the size of the grammar is taken into account.
no code implementations • 16 May 2022 • Andreas Maletti, Lena Katharina Schiffer
Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i. e., generate the same class of string languages).