<?xml version="1.0" standalone="yes"?>
<Paper uid="E87-1047">
  <Title>REPRESENTATION OF FEATURE SYSTEMS IN A NON-CONNECTIONIST MOLECULAR MACHINE</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> Of the various branches of modern linguistic theory, phonology, as usual, was the first one to come up with really restrictive theories of features and feature systems, largely supported by empirical evidence coming from the study of a legion of linguistic phenomena.</Paragraph>
    <Paragraph position="1"> Phonology will most probably remain main source of evidence as far as the functioning of feature-based cognitive processes is concerned.</Paragraph>
    <Paragraph position="2"> The present paper sets out to outline how a particular kind of feature system, close to several recent theories of phonological features, can be represented in connectionist networks. However, since some of the mechanisms involved, seriality and synchronization in particular, fall outside the scope of the existing connectionist networks, a nonconnectionist model simulating would-be serial connectionist networks will be used instead. The automaton described in the paper is able to unify feature structures as programs to be run on the machine itself.</Paragraph>
  </Section>
class="xml-element"></Paper>