• Refine your search:
  • 
    Keyword:
    
    • Optimalitätstheorie (19)
    • Konnektionismus (10)
    • Kognitionsforschung (9)
    • Theorie (Spracherwerb) (9)
    • FOS Computer and information sciences (8)
    • Computation and Language cs.CL (7)
    • Mentale Repräsentation (7)
    • Universalgrammatik (7)
    • Englisch (6)
    • Parsing (psycholing.) (6)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium:
    
    • Print (79)
    • Online (35)
    • Miscellaneous (1)
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Page: 1 2 3 4 5 6 Hits 1 – 20 of 115 1 Optimality Theory: Constraint Interaction in Generative Grammar ... Smolensky, Paul; Prince, Alan S.. - : Rutgers University, 2022 BASE Show details 2 Compositional processing emerges in neural networks solving math problems Russin, Jacob; Fernandez, Roland; Palangi, Hamid... In: Proceedings of the Annual Meeting of the Cognitive Science Society, vol 43, iss 43 (2021) BASE Show details 3 Infinite use of finite means? Evaluating the generalization of center embedding learned from an artificial grammar McCoy, Richard Thomas; Culbertson, Jennifer; Smolensky, Paul; Legendre, Geraldine In: Proceedings of the Annual Meeting of the Cognitive Science Society, vol 43, iss 43 (2021) Abstract: Human language is often assumed to make "infinite use of finite means" - that is, to generate an infinite number of possible utterances from a finite number of building blocks. From an acquisition perspective, this assumed property of language is interesting because learners must acquire their languages from a finite number of examples. To acquire an infinite language, learners must therefore generalize beyond the finite bounds of the linguistic data they have observed. In this work, we use an artificial language learning experiment to investigate whether people generalize in this way. We train participants on sequences from a simple grammar featuring center embedding, where the training sequences have at most two levels of embedding, and then evaluate whether participants accept sequences of a greater depth of embedding. We find that, when participants learn the pattern for sequences of the sizes they have observed, they also extrapolate it to sequences with a greater depth of embedding. These results support the hypothesis that the learning biases of humans favor languages with an infinite generative capacity. Keyword: cognitive science URL: https://escholarship.org/uc/item/67z0195s BASE Hide details 4 Compositional Processing Emerges in Neural Networks Solving Math Problems ... Russin, Jacob; Fernandez, Roland; Palangi, Hamid. - : arXiv, 2021 BASE Show details 5 Distributed neural encoding of binding to thematic roles ... Lalisse, Matthias; Smolensky, Paul. - : arXiv, 2021 BASE Show details 6 Infinite use of finite means? Evaluating the generalization of center embedding learned from an artificial grammar ... 43rd Annual Meeting of the Cognitive Science Society 2021; Culbertson, Jennifer; Legendre, Geraldine. - : Underline Science Inc., 2021 BASE Show details 7 Compositional processing emerges in neural networks solving math problems ... 43rd Annual Meeting of the Cognitive Science Society 2021; Fernandez, Roland; Gao, Jianfeng. - : Underline Science Inc., 2021 BASE Show details 8 How much do language models copy from their training data? Evaluating linguistic novelty in text generation using RAVEN ... McCoy, R. Thomas; Smolensky, Paul; Linzen, Tal. - : arXiv, 2021 BASE Show details 9 Compositional Processing Emerges in Neural Networks Solving Math Problems Russin, Jacob; Fernandez, Roland; Palangi, Hamid... In: Cogsci (2021) BASE Show details 10 Emergent Gestural Scores in a Recurrent Neural Network Model of Vowel Harmony Smolensky, Paul; Smith, Caitlin; Rosen, Eric... In: Proceedings of the Society for Computation in Linguistics (2021) BASE Show details 11 Testing for Grammatical Category Abstraction in Neural Language Models Kim, Najoung; Smolensky, Paul In: Proceedings of the Society for Computation in Linguistics (2021) BASE Show details 12 Universal linguistic inductive biases via meta-learning ... McCoy, R. Thomas; Grant, Erin; Smolensky, Paul. - : arXiv, 2020 BASE Show details 13 Tensor Product Decomposition Networks: Uncovering Representations of Structure Learned by Neural Networks McCoy, Richard T; Linzen, Tal; Dunbar, Ewan... In: Proceedings of the Society for Computation in Linguistics (2020) BASE Show details 14 Learning a gradient grammar of French liaison Smolensky, Paul; Rosen, Eric; Goldrick, Matthew In: Proceedings of the Annual Meetings on Phonology; Proceedings of the 2019 Annual Meeting on Phonology ; 2377-3324 (2020) BASE Show details 15 RNNs Implicitly Implement Tensor Product Representations Mccoy, R. Thomas; Linzen, Tal; Dunbar, Ewan... In: International Conference on Learning Representations ; ICLR 2019 - International Conference on Learning Representations ; https://hal.archives-ouvertes.fr/hal-02274498 ; ICLR 2019 - International Conference on Learning Representations, May 2019, New Orleans, United States (2019) BASE Show details 16 Quantum Language Processing ... Wiebe, Nathan; Bocharov, Alex; Smolensky, Paul. - : arXiv, 2019 BASE Show details 17 Transient blend states and discrete agreement-driven errors in sentence production Goldrick, Matthew; Brehm, Laurel; Cho, Pyeong Whan... In: Proceedings of the Society for Computation in Linguistics (2019) BASE Show details 18 Augmentic Compositional Models for Knowledge Base Completion Using Gradient Representations Lalisse, Matthias R; Smolensky, Paul In: Proceedings of the Society for Computation in Linguistics (2019) BASE Show details 19 Augmenting Compositional Models for Knowledge Base Completion Using Gradient Representations ... Lalisse, Matthias; Smolensky, Paul. - : arXiv, 2018 BASE Show details 20 A Simple Recurrent Unit with Reduced Tensor Product Representations ... Tang, Shuai; Smolensky, Paul; de Sa, Virginia R.. - : arXiv, 2018 BASE Show details Page: 1 2 3 4 5 6

Mobile view All Catalogues UB Frankfurt Linguistik 10 IDS Mannheim 2 OLC Linguistik 21 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 1 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 2 Bibliographies BLLDB 38 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 22 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 34 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0