Connectionism, Learning and Linguistics Structure

Abstract

This thesis presents a connectionist theory of how infinite languages may fit within finite minds.Arguments are presented against the distinction between linguistic competence and observable language performance.It is suggested that certain kinds of finite state automata, i.e recurrent neural networks are likely to have suffcient computational power,and the necessary generalization capability,to serve as models for the procesing and acquisition of linguistic structure.