<?xml version="1.0" standalone="yes"?>
<Paper uid="P94-1018">
  <Title>A Psycholinguistically Motivated Parser for CCG</Title>
  <Section position="3" start_page="125" end_page="125" type="intro">
    <SectionTitle>
2 Preliminaries
</SectionTitle>
    <Paragraph position="0"> CCG is a lexicalized grammar formalism -- a lexicon assigns each word to one or more grammatical categories. Adjacent constituents can combine by one of a small number of combinatory rules. The universe of grammatical categories contains a collection of basic categories (e.g. atomic symbols such as n, np, s, etc. or Prolog terms such np(3,sg)) and is closed under the category-forming connectives / and \. Intuitively a constituent of category X/Y (resp. X\Y) is something of category X which is missing something of category Y to its right (resp.</Paragraph>
    <Paragraph position="1"> left). The combinatory rules are listed 1 in table 1.</Paragraph>
    <Paragraph position="2"> They formalize this intuition. A combinatory rule may be qualified with a predicate over the variables X, Y, and Z1...Zn.</Paragraph>
    <Paragraph position="3"> A derivation is a binary tree whose leaves are each a single-word constituent, and whose internal nodes are each a constituent which is derived from its children by an application of one of the combinatory rules. A string w is grammatical just in case there exists a derivation whose frontier is w. I equivocate between a derivation and the constituent at its root. An analysis of a string w is a sequence of derivations such that the concatenation of their frontiers is w.</Paragraph>
  </Section>
class="xml-element"></Paper>