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.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:561657 |
| Date | January 1995 |
| Creators | Christiansen, Morten H. |
| Contributors | Chater, Nick. ; Paul, Schweizer |
| Publisher | University of Edinburgh |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://hdl.handle.net/1842/526 |
Page generated in 0.0027 seconds