<?xml version="1.0" standalone="yes"?>
<Paper uid="P88-1034">
  <Title>COMBINATORY CATEGORIAL GRAMMARS: GENERATIVE POWER AND RELATIONSHIP TO LINEAR CONTEXT-FREE REWRITING SYSTEMS&amp;quot;</Title>
  <Section position="8" start_page="283" end_page="284" type="concl">
    <SectionTitle>
6 Conclusions
</SectionTitle>
    <Paragraph position="0"> In this paper we have considered the string languages and derivation trees produced by CCL's. We have shown that CCG's generate the same class of string languages  as TAG's, HG's, and LIG's. The derivation tree sets normally associated with CCG's are found to be the same as those of LIG's. They have context-free path sets, and nodes labeled by an unbounded alphaboL A consequence of the proof of equivalence with TAG is the existence of a normal form for CCG's having the property that derivation trees can be given for grammars in this normal form that are structurally the same as the derivation trees of CFG's. The question of whether there is a method of representing the derivations of arbitrary CCG's with tree sets similar to those of CFG's remains open. Thus, it is unclear, whether, despite their restricted weak generative power, CCG's can be classified as LCFRS's.</Paragraph>
  </Section>
class="xml-element"></Paper>