de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Book Chapter

Towards a brain compatible theory of syntax based on local testability

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons83825

Braitenberg,  V
Former Department Structure and Function of Natural Nerve-Net, Max Planck Institute for Biological Cybernetics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Crespi Reghizzi, S., & Braitenberg, V. (2003). Towards a brain compatible theory of syntax based on local testability. In Grammars and automata for string processing: from mathematics and computer science to biology, and back (pp. 17-32). London, UK: Taylor Francis.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-DDF0-4
Abstract
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their description by generative grammars has met with difficulties. The type 2 (context-free) grammars account for constituent structure, but already trespass the mathematical capacity required by language, because they generate unnatural mathematical sets: a consequence of being based on recursive function theory. Abstract associative models investigated by formal language theoreticians (Schutzenberger, McNaughton, Papert, Brzozowsky, Simon) are known as locally testable models. A combination of locally testable and constituent structure models is proposed under the name of Associative Language Description, arguing that it equals type 2 grammars in explanatory adequacy, yet is compatible with brain models. Two versions of ALD are exemplified and discussed: one based on modulation, the other on pattern rules. A sketch of brain organization in terms of cell assemblies and synfire chains concludes.