منابع مشابه
Word repetitions in sentence recognition.
When some items on a list are strengthened by extra study time or repetitions, recognition of other, unrelated, list items is not harmed (Ratcliff, Clark, & Shiffrin, 1990). Shiffrin, Ratcliff, and Clark (1990) accounted for this list-strength finding with a model assuming that different items are stored separately in memory, but that repetitions are accumulated together into a single stronger ...
متن کاملBilingual Word Recognition in a Sentence Context
This article provides an overview of bilingualism research on visual word recognition in isolation and in sentence context. Many studies investigating the processing of words out-of-context have shown that lexical representations from both languages are activated when reading in one language (language-non-selective lexical access). A newly developed research line asks whether language-non-selec...
متن کاملSentence context, word recognition, and repetition blindness.
When the sentence She ran her best time yet in the rice last week is displayed using rapid serial visual presentation, viewers sometimes misread rice as race (M. C. Potter, A. Moryadas, I. Abrams, & A. Noel, 1993). Seven experiments combined misreading and repetition blindness (RB) paradigms to determine whether misreading of a word because of biasing sentence context represents a genuine perce...
متن کاملWord repetitions in Japanese spontaneous speech
This paper examines several hypotheses based on a ‘strategic’ view of word repetitions in English. We test whether these hypotheses also apply to Japanese with its fundamentally different syntax. Analyses of 10 task-oriented Japanese dialogues reveal two effects. First, pauses are more frequent before and just after a word at a suspension of the speech than after a repetition of that word. Seco...
متن کاملRepetitions in the infinite n-bonacci word
Abstract The Fibonacci word Fm is defined as the concatenation of the preceding two Fibonacci words Fm−1 and Fm−2. We generalize it to the n-bonacci word as the concatenation of the preceding n words. We consider the structure of the subword repetitions in the n-bonacci word. In Fibonacci word (n = 2), the maximal repetition of the subword is known to be less than 2 + φ, where φ = (1 + √ 5)/2 i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memory & Cognition
سال: 1991
ISSN: 0090-502X,1532-5946
DOI: 10.3758/bf03197109