Distributed representations, simple recurrent networks, and grammatical structure Export

@article{citeulike:945493, abstract = {In this paper three problems for a connectionist account of language are considered1.What is the nature of linguistic representations?2.How can complex structural relationships such as constituent be represented?3.How can the apparently open-ended nature of language be accommodated by a fixed-resource system?}, author = {Elman, Jeffrey L.}, citeulike-article-id = {945493}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF00114844}, citeulike-linkout-1 = {http://www.springerlink.com/content/x3u700q40767032g}, day = {1}, doi = {10.1007/BF00114844}, journal = {Machine Learning}, keywords = {connectionism, embeddings, modelling, recurrent\_network, relative\_clauses, sentence\_processing}, month = {September}, number = {2}, pages = {195--225}, posted-at = {2009-10-12 18:08:54}, priority = {3}, title = {Distributed representations, simple recurrent networks, and grammatical structure}, url = {http://dx.doi.org/10.1007/BF00114844}, volume = {7}, year = {1991} }

TY - JOUR ID - citeulike:945493 L3 - citeulike-article-id:945493 N2 - In this paper three problems for a connectionist account of language are considered1.What is the nature of linguistic representations?2.How can complex structural relationships such as constituent be represented?3.How can the apparently open-ended nature of language be accommodated by a fixed-resource system? IS - 2 JF - Machine Learning EP - 225 TI - Distributed representations, simple recurrent networks, and grammatical structure VL - 7 SP - 195 KW - connectionism KW - embeddings KW - modelling KW - recurrent_network KW - relative_clauses KW - sentence_processing AU - Elman, Jeffrey PY - 1991/09/01/ UR - http://dx.doi.org/10.1007/BF00114844 ER -