Advanced search
1 file | 204.08 KB

Strong systematicity in sentence processing by simple recurrent networks

Author
Organization

Downloads

  • paper344.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 204.08 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Brakel, Philémon, and Stefan Frank. 2009. “Strong Systematicity in Sentence Processing by Simple Recurrent Networks.” In 31th Annual Conference of the Cognitive Science Society, Proceedings, ed. Niels Taatgen, Hedderik Rijn van, and John Nerbonne, 1599–1604. Austin TX, USA: Cognitive Science Society.
APA
Brakel, P., & Frank, S. (2009). Strong systematicity in sentence processing by simple recurrent networks. In N. Taatgen, H. Rijn van, & J. Nerbonne (Eds.), 31th Annual Conference of the Cognitive Science Society, Proceedings (pp. 1599–1604). Presented at the 31th Annual Conference of the Cognitive Science Society (COGSCI - 2009), Austin TX, USA: Cognitive Science Society.
Vancouver
1.
Brakel P, Frank S. Strong systematicity in sentence processing by simple recurrent networks. In: Taatgen N, Rijn van H, Nerbonne J, editors. 31th Annual Conference of the Cognitive Science Society, Proceedings. Austin TX, USA: Cognitive Science Society; 2009. p. 1599–604.
MLA
Brakel, Philémon, and Stefan Frank. “Strong Systematicity in Sentence Processing by Simple Recurrent Networks.” 31th Annual Conference of the Cognitive Science Society, Proceedings. Ed. Niels Taatgen, Hedderik Rijn van, & John Nerbonne. Austin TX, USA: Cognitive Science Society, 2009. 1599–1604. Print.
@inproceedings{2057315,
  author       = {Brakel, Phil{\'e}mon and Frank, Stefan},
  booktitle    = {31th Annual Conference of the Cognitive Science Society, Proceedings},
  editor       = {Taatgen, Niels and Rijn van, Hedderik and Nerbonne, John },
  language     = {eng},
  location     = {Amsterdam, The Netherlands},
  pages        = {1599--1604},
  publisher    = {Cognitive Science Society},
  title        = {Strong systematicity in sentence processing by simple recurrent networks},
  year         = {2009},
}