<?xml version="1.0" standalone="yes"?>
<Paper uid="E87-1047">
  <Title>REPRESENTATION OF FEATURE SYSTEMS IN A NON-CONNECTIONIST MOLECULAR MACHINE</Title>
  <Section position="7" start_page="299" end_page="300" type="concl">
    <SectionTitle>
FURTHER PLANS, IMPLEMENTATION
</SectionTitle>
    <Paragraph position="0"> It is far from evident that syntactic and semantic rule systems should carry out operations similar to those in phonological rules. On the other hand, the operation of the molecular machine are general enough to eventually encompass syntactic and semantic processes such as recognition and completion of syntactic patterns, inference making through unification, etc. Some of these operations are outlined in Kalman and Kornai (1985) and Kalman (1986).</Paragraph>
    <Paragraph position="1">  A small molecular machine is implemented in Zoltan Schreter's (FPSE, Geneva University) CNS connectionist simulation system running on Olivetti M24/M28 PCs. However, owing to the capacity of the machines (and of TLC Lisp, in which the system has been written) the number of molecules is extremely limited, and the performance obtained is rather poor.</Paragraph>
  </Section>
class="xml-element"></Paper>