<?xml version="1.0" standalone="yes"?>
<Paper uid="C88-1006">
  <Title>Morphology with Two-Level Rules and Negative Rule Features</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> The theme of this paper is how to deal with the phonological or orthographic half of the problem of computational morphology, i.e., how to handle the various problems associated with the spellings of morphemes. The examples in this paper have been drawn from English orthography but it is easy to find examples from other languages where these techniques would be applicable as well.</Paragraph>
    <Paragraph position="1"> In an earlier paper \[2\], I presented a formalism for two-level phonological (or orthographic) rules very similar to Koskenneimi's \[8\] and described how rules in that formalism could be interpreted in a computational system. There were problems with both my formalism and Koskenniemi's that could have been solved with the device of negative rule features. In this paper I discuss these problems and their solutions.</Paragraph>
  </Section>
class="xml-element"></Paper>