<?xml version="1.0" standalone="yes"?>
<Paper uid="C86-1028">
  <Title>Lexicase Parsing: A Lexicon-driven App.roach. to Syntactic Analysis</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1. Introduction
</SectionTitle>
    <Paragraph position="0"> There are a number of current frameworks of syntactic analysis which have been used as the basis for natural language processing.</Paragraph>
    <Paragraph position="1"> Many suffer from serious metatheoretical or pra(:tieal defects, especially in the areas of power and descriptive adequacy. Several more recent syntactic fl'ameworks, including I,exical-Functional Grammar \[1\], Generalized Phrase Structure Grammm&amp;quot; \[2\], and Lexiease \[3\] have begun to take these problems seriously, and to consider al)plications to natural language processi~g. This paper will be concerned with the application of lexiease grammatical theory to computer parsing of natural language texts.</Paragraph>
    <Paragraph position="2"> The point of view which we will adopt here is a very simple one: sentences are hierarchically structured strings of words, and grammar is a statement about the internal composition and external distributions of words. Proceeding from this basis, it is possible to construct a fornml and explicit grannnatical fl'amework of limited generative power which is capable of stating language-specific and universal generalizations in a natural way, unhh}dered by pretheoretieal a priori assumptions about VP's, etc. The fl'amework so constructed, lexiease \[13\], \[4\], \[5\], turns out to have a significant 1)otential for application in the processing of natural language \[6\], The basic descriptive mechanism in a lexiease grammar is lexieal features. The properties of lexieal items are represented by eantextual and non-.contexttlal features, aud generalizations are expressed as relationships among sets of these features. The ways in which words can combine together are strongly restricted by the Sisterhead Constraint \[3\], which states that a word can contract a grammatleal relationship only with the head of a dependent sister eonstruetlon, and tbe One-bar Constraint lop. ell,l, which requires every construction to have at least one lexical head. The result is syntaetie tree representations which are flatter, since there are no intermediate nodes between lexical entries and their maximal projections, and more universal, since there are only a very limited number of ways in which languages can differ in their grammars.</Paragraph>
    <Paragraph position="3"> These properties turn out to make lexicase especially well suited to machine translation, since the grammatical representations for</Paragraph>
  </Section>
class="xml-element"></Paper>