<?xml version="1.0" standalone="yes"?>
<Paper uid="E89-1008">
  <Title>PARADIGMATIC MORPHOLOGY</Title>
  <Section position="8" start_page="0" end_page="0" type="concl">
    <SectionTitle>
8 Implementation
</SectionTitle>
    <Paragraph position="0"> All aspects of the system described above have been implemented, primarily by Mike Reape. The implementation of lexical rules differs somewhat from the presentation given here, in that we allow the association of a PATR-II style lexical rules with the lexical rules we describe above and, as such, lexical rules may perform arbitrary mappings over feature structures. The work considerably extended published string unification algorithms to handle identity and arbitrary constraints over string forms. The system is a subcomponent of a polytheoretic lexicon system (Calder and te Lindert 1987, cf. also Zaenen 1988) and is currently being used to generate English lexical entries for use with Unification Categorial Grammar (Zeevat et al 1986, Calder et al 1986). The system generates lexical entries off-line; the lexicons used to date have provably finite closures under the application of lexical rules. Current work is focused on the computational interpretation of paradigms and on descriptive work in languages other than English.</Paragraph>
  </Section>
class="xml-element"></Paper>