首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   113篇
  免费   10篇
  国内免费   8篇
  2023年   1篇
  2022年   1篇
  2021年   3篇
  2020年   4篇
  2018年   4篇
  2017年   6篇
  2016年   7篇
  2015年   2篇
  2014年   5篇
  2013年   17篇
  2012年   5篇
  2011年   8篇
  2010年   1篇
  2009年   4篇
  2008年   10篇
  2007年   6篇
  2006年   6篇
  2005年   4篇
  2004年   9篇
  2003年   4篇
  2002年   5篇
  2001年   2篇
  2000年   2篇
  1999年   4篇
  1998年   1篇
  1997年   1篇
  1995年   2篇
  1992年   1篇
  1990年   1篇
  1978年   1篇
  1977年   2篇
  1976年   1篇
  1975年   1篇
排序方式: 共有131条查询结果,搜索用时 31 毫秒
31.
Implicit learning is the acquisition of complex information without the intention to learn. The aim of this study was to investigate the influence of temporal regularities on the implicit learning of an artificial pitch grammar. According to the dynamic attending theory (DAT) external regularities can entrain internal oscillators that guide attention over time, inducing temporal expectations that influence perception of future events. In the present study, the presentation of the artificial pitch grammar in the exposure phase was temporally either regular or irregular for one of two participant groups. Based on the DAT, it was hypothesized that the regular temporal presentation would favour implicit learning of tone structures in comparison to the irregular temporal presentation. Results demonstrated learning of the artificial grammar for the group with the regular exposure phase and partial learning for the group with the irregular exposure phase. These findings suggest that the regular presentation helps listeners to develop perceptual expectations about the temporal occurrence of future tones and thus facilitates the learning of the artificial pitch grammar.  相似文献   
32.
人工语法中的内隐学习实验研究   总被引:3,自引:1,他引:2  
徐大真 《心理科学》2000,23(4):450-453
用Reber等人发明的人工语法和人工语法学习程序,研究在复杂规则学习中的内隐学习与外显学习过程.实验结果发现内隐学习中启动效应存在,内隐学习效应明显,支持Reber等人提出的内隐学习理论;对内隐记忆与外显记忆关系的研究,支持杨治良等(1998)提出的内隐和外显记忆的"钢筋水泥"结构性模型的假设.  相似文献   
33.
We define an automata-theoretic counterpart of (type-logical)grammars based on the (associative) Lambek-calculus L, a prominentformalism in computational linguistics. While the usual push-downautomaton (PDA) has the same weak generative power as the L-basedgrammars (Pentus, 1995), there is no direct relationship betweenthe computations of a PDA for some language L and the derivationsof an L-based grammar for L. In the Lambek-automaton, on theother hand, there is a tight relation (1-1) between automatoncomputations and grammar derivations. The automaton exhibitsa novel mode of operation, using hypothetical steps, directlyinspired by the hypothetical reasoning embodied by L.  相似文献   
34.
The Lambek calculus introduced in Lambek [6] is a strengthening of the type reduction calculus of Ajdukiewicz [1]. We study Associative Lambek Calculus L in Gentzen style axiomatization enriched with a finite set Γ of nonlogical axioms, denoted by L(Γ).It is known that finite axiomatic extensions of Associative Lambek Calculus generate all recursively enumerable languages (see Buszkowski [2]). Then we confine nonlogical axioms to sequents of the form pq, where p and q are atomic types. For calculus L(Γ) we prove interpolation lemma (modifying the Roorda proof for L [10]) and the binary reduction lemma (using the Pentus method [9] with modification from [3]). In consequence we obtain the weak equivalence of the Context-Free Grammars and grammars based on L(Γ).  相似文献   
35.
Glossolalia (“speaking in tongues”) is a rhythmic utterance of word-like strings of sounds, regularly occurring in religious mass gatherings or various forms of private religious practices (e.g., prayer and meditation). Although specific verbal learning capacities may characterize glossolalists, empirical evidence is lacking. We administered three statistical learning tasks (artificial grammar, phoneme sequence, and visual-response sequence) to 30 glossolalists and 30 matched control volunteers. In artificial grammar, participants decide whether pseudowords and sentences follow previously acquired implicit rules or not. In sequence learning, they gradually draw out rules from repeating regularities in sequences of speech sounds or motor responses. Results revealed enhanced artificial grammar and phoneme sequence learning performances in glossolalists compared to control volunteers. There were significant positive correlations between daily glossolalia activity and artificial grammar learning. These results indicate that glossolalists exhibit enhanced abilities to extract the statistical regularities of verbal information, which may be related to their unusual language abilities.  相似文献   
36.
Three experiments explored the extent to which surface features explain discrimination between grammatical and non-grammatical strings in artificial grammar learning (AGL). Experiment 1 replicated Knowlton and Squire’s (1996) paradigm using either letter strings as in the original study, or an analogous set of color strings to further explore if learning was affected by type of stimuli. Learning arose only with letter strings, but the results were mostly due to the discrimination of non-grammatical strings containing highly salient illegal features. Experiments 2 and 3 tested a new grammar devised to control for those features. Experiment 2 showed reduced grammar learning effects, and again only for letter materials. Experiment 3 explored the effect of additional practice with letter stimuli, and found increased learning only in the spaced practice condition, though additional practice also produced more explicit knowledge. These findings call for further research on the boundary conditions of learning in AGL paradigms.  相似文献   
37.
In this paper we present learning algorithms for classes of categorial grammars restricted by negative constraints. We modify learning functions of Kanazawa [10] and apply them to these classes of grammars. We also prove the learnability of intersection of the class of minimal grammars with the class of k-valued grammars. Presented by Wojciech Buszkowski  相似文献   
38.
Jakob Hohwy 《Synthese》2007,159(3):315-328
Different cognitive functions recruit a number of different, often overlapping, areas of the brain. Theories in cognitive and computational neuroscience are beginning to take this kind of functional integration into account. The contributions to this special issue consider what functional integration tells us about various aspects of the mind such as perception, language, volition, agency, and reward. Here, I consider how and why functional integration may matter for the mind; I discuss a general theoretical framework, based on generative models, that may unify many of the debates surrounding functional integration and the mind; and I briefly introduce each of the contributions.  相似文献   
39.
近年来,人工神经网络模型常被用来模拟各种心理活动,从而为心理学的一些相关理论提供丰富的证据,内隐学习也不例外。基于权重调整来学习正确反应的人工神经网络模型和内隐学习的两大本质特征间有着极为相应的匹配,因此,人工神经网络模型特别适用于内隐学习研究。到目前为止,针对两种较为普遍的内隐学习任务,已经相应地出现了两种使用较为广泛的神经网络模型——自动联系者和简单循环网络  相似文献   
40.
In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle’s analysis of intentional action. We then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest some explanatory hypotheses: (1) linguistic recursion is embodied in sensory-motor processing; (2) linguistic and motor-intentional recursions are distinct and mutually independent mechanisms. Finally, we propose some reflections about the epistemic status of HCF as presenting an empirically falsifiable hypothesis, and on the possibility of testing recursion in different cognitive domains.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号