<?xml version="1.0" standalone="yes"?>
<Paper uid="P86-1012">
  <Title>CATEGORIAL AND NON-CATEGORIAL LANGUAGES</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
CATEGORIAL AND NON-CATEGORIAL LANGUAGES
</SectionTitle>
    <Paragraph position="0"/>
    <Paragraph position="2"> We study the formal and linguistic properties of a class of parenthesis-free categorial grammars derived from those of Ades and Steedman by varying the set of reduction rules. We characterize the reduction rules capable of generating context-sensitive languages as those having a partial combination rule and a combination rule in the reverse direction. We show that any categorial language is a permutation of some context-free language, thus inheriting properties dependent on symbol counting only. We compare some of their properties with other contemporary formalisms.</Paragraph>
  </Section>
class="xml-element"></Paper>