In order to compare the descriptional complexity of context-free and (combinatoric) categorical I need a way to check if a categorical grammar of a formal language is minimal concerning lexical entries.

Any ideas on how to do that? Any work on this, that you might know of?


  • $\begingroup$ BTW, if you are reading this, Ronny, I really like to get in touch with you! :) $\endgroup$ Sep 16, 2013 at 20:29
  • 1
    $\begingroup$ Could you remind everyone what a CCG is, and explain what "minimal concerning lexical entries" might mean, or point to relevant sources? $\endgroup$
    – Sylvain
    Sep 17, 2013 at 18:27
  • $\begingroup$ Sorry I didn't provide that. For combinatoric categorial grammars please see en.wikipedia.org/wiki/Combinatory_categorial_grammar. By "minimal concerning lexical entries" I mean that there is no grammar describing the same language with fewer lexical entries. $\endgroup$ Sep 19, 2013 at 21:29


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.