<?xml version="1.0" standalone="yes"?>
<Paper uid="C82-1019">
  <Title>AN EXPERIMENTAL PARSER</Title>
  <Section position="2" start_page="0" end_page="121" type="intro">
    <SectionTitle>
INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> Uppsala Chart ProcessOr (UCP) includes the basic mechanisms of a refined version of the general syntactic processor (GSP), presented by M Kay in 1977, see /I/. An integrated part of the UCP is the UCP grammar formalism. The starting point for the UCP formalism was the 'reversible grammar formalism', see /2/.</Paragraph>
    <Paragraph position="1"> The reversible grammar formalism includes the specification of a format for linguistic descriptions, - the structure - , and a set of reversible - apt for generation as well as analysis - grammar operators.</Paragraph>
    <Paragraph position="2"> In the UCP we keep the idea of a procedural grammar formalism, consisting of a set of grammar operators, and also the structure for representing linguistic descriptions. We don't, however, impose any requirements of 'reversibility' upon the operators. UCP in its present version is designed for analysis.</Paragraph>
    <Paragraph position="3"> Our extensions and modifications were motivated bY our attempt to apply the conceptual and computational machinery of the GSP and the reversible grammar formalism to phonological and morphological analysis of Finnish and to morphological and syntactic analysis of Swedish.</Paragraph>
    <Paragraph position="4"> Basically, the extensions consist in creating the means for embedding various kinds of linguistic processing - dictionary search, rewriting, phonological, morphological, and syntactic analysis - in the framework offered by the GSP and for arranging for some interaction between them. Our solution to these problems is based upon the procedural nature of the UCP formalism. We created the means that were needed by defining new grammar operators.</Paragraph>
    <Paragraph position="5"> All language specific information of a UCP parser is expressed in the procedural UCP formalism. This is true, not only for rules but also for dictionary articles.</Paragraph>
    <Paragraph position="6"> An optional part of a UCP parser is a 'filter grammar', stating what rules should apply to what linguistic units. The filter grammar itself is expressed in the UCP formalism.</Paragraph>
  </Section>
class="xml-element"></Paper>