Grammar-based connectionist approaches to language

被引:26
|
作者
Smolensky, P [1 ]
机构
[1] Johns Hopkins Univ, Dept Cognit Sci, Baltimore, MD 21218 USA
基金
美国国家科学基金会;
关键词
D O I
10.1207/s15516709cog2304_9
中图分类号
B84 [心理学];
学科分类号
04 ; 0402 ;
摘要
This article describes on approach to connectionist language research that relies on the development of grammar formalisms rather than computer models. From formulations of the fundamental theoretical commitments of connectionism and of generative grammar, it is argued that these two paradigms ore mutually compatible. Integrating the basic assumptions of the paradigms results in formal theories of grammar that centrally incorporate a certain degree of connectionist computation. Two such grammar formalisms-Harmonic Grammar (Legendre, Miyata, & Smolensky, 1990a,b) and Optimality Theory (Prince & Smolensky, 1991, 1993)-are briefly introduced to illustrate grammar-based approaches to connectionist language research. The strengths and weaknesses of grammar-based research and more traditional model-based research are argued to be complementary, suggesting a significant role for both strategies in the spectrum of connectionist language research.
引用
收藏
页码:589 / 613
页数:25
相关论文
共 50 条
  • [31] Grammar-based Automatic Extraction of Definitions
    Iftene, Adrian
    Pistol, Ionut
    Trandabat, Diana
    PROCEEDINGS OF THE 10TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, 2009, : 110 - 115
  • [32] Grammar-Based String Refinement Types
    Zhu, Fengmin
    2023 IEEE/ACM 45TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING: COMPANION PROCEEDINGS, ICSE-COMPANION, 2023, : 267 - 269
  • [33] Grammar-based Tree Swarm Optimization
    Grinan, David
    Ibias, Alfredo
    Nunez, Manuel
    2019 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), 2019, : 76 - 81
  • [34] A Grammar-Based Framework for Rehabilitation Exergames
    Fernandez-Cervantes, Victor
    Stroulia, Eleni
    Hunter, Benjamin
    ENTERTAINMENT COMPUTING - ICEC 2016, 2016, 9926 : 38 - 50
  • [35] Astraea: Grammar-Based Fairness Testing
    Soremekun, Ezekiel
    Udeshi, Sakshi
    Chattopadhyay, Sudipta
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2022, 48 (12) : 5188 - 5211
  • [36] Grammar-based geodesics in semantic networks
    Rodriguez, Marko A.
    Watkins, Jennifer H.
    KNOWLEDGE-BASED SYSTEMS, 2010, 23 (08) : 844 - 855
  • [37] Grammar-Based Compression of Unranked Trees
    Gascon, Adria
    Lohrey, Markus
    Maneth, Sebastian
    Reh, Carl Philipp
    Sieber, Kurt
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (01) : 141 - 176
  • [38] Grammar-based test generation with YouGen
    Hoffman, Daniel Malcolm
    Ly-Gagnon, David
    Strooper, Paul
    Wang, Hong-Yi
    SOFTWARE-PRACTICE & EXPERIENCE, 2011, 41 (04): : 427 - 447
  • [39] GRAMMAR-BASED DEFINITION OF METAPROGRAMMING SYSTEMS
    CAMERON, RD
    ITO, MR
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1984, 6 (01): : 20 - 54
  • [40] Grammar-Based Compression of Unranked Trees
    Adrià Gascón
    Markus Lohrey
    Sebastian Maneth
    Carl Philipp Reh
    Kurt Sieber
    Theory of Computing Systems, 2020, 64 : 141 - 176