Recurrent Linguistic Domain Papers?

[pollack@CIS.OHIO-STATE.EDU]

Tom, 

It is clear
that naive applications of connectionism usually lead 
to finite state models with limited representational abilities.
Having been one of the first to build such a limited model
(Pollack & Waltz 1982, 85), I've been working on this question,
and have a couple of answers for your professor:
 
In my 1987 Ph.D thesis from the University of Illinois, I show how to
build a TM with units having rational outputs, linear combinations,
thresholds and multiplicative gating.  ($6 for mccs-87-100 from TR
librarian, CRL, NMSU, Las Cruces NM 88003)

The work on RAAM (88 Cogsci conf and AIJ in press) shows how to get stacks
and trees into fixed-width distributed representations.
(pollack.newraam.ps.Z in pub/neuroprose)

My "strange automata" paper (submitted) shows that a high order
recurrent network can bifurcate to chaos becoming an infinite state
machine (in what chomsky class?) whose transitions are not arbitrary
but are controlled by an underlying strange attractor.

Jordan Pollack                            Assistant Professor
CIS Dept/OSU                              Laboratory for AI Research
2036 Neil Ave                             Email: pollack at cis.ohio-state.edu
Columbus, OH 43210                        Fax/Phone: (614) 292-4890