Although most studies of reading English (and other alphabetic languages) have indicated that readers do not obtain preview benefit from word n + 2, Yang, Wang, Xu, and Rayner (2009) reported evidence that Chinese readers obtain preview benefit from word n + 2. However, this effect may not be common in Chinese because the character prior to the target word in Yang et al.'s experiment was always...

The boundary paradigm (Rayner, 1975) with a novel preview manipulation was used to examine the extent of parafoveal processing of words to the right of fixation. Words n + 1 and n + 2 had either correct or incorrect previews prior to fixation (prior to crossing the boundary location). In addition, the manipulation utilized either a high or low frequency word in word n + 1 location on the assump...

The non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that appear at the beginning of x prior to the first repetition of a length-n factor. We examine general properties of the non-repetitive complexity function, as well as obtain formulas for the non-repetitive complexity of the Thue...

A word of length n over a 1nite alphabet A is a map from {0; : : : ; n − 1} into A. A partial word of length n over A is a partial map from {0; : : : ; n− 1} into A. In the latter case, elements of {0; : : : ; n−1} without image are called holes (a word is just a partial word without holes). In this paper, we extend a fundamental periodicity result on words due to Fine and Wilf to partial words...

Given positive integers n, and p1, . . . , pr, we define a fast word combinatorial algorithm for constructing a word w = w1 · · ·wn of length n, with periods p1, . . . , pr, and on the maximal number of distinct letters. We show that the constructed word, which is unique up to word isomorphism, is a pseudo-palindrome, i.e., is a fixed point of an involutory antimorphism.

Schizophrenic (n = 21), bipolar (n = 18), and normal control subjects (n = 21) were compared on a word recognition measure of semantic priming. The task involved the presentation of related, neutral, and unrelated word pairs; the second word (target word) in each pair was presented in a degraded form. Facilitation was defined as the accuracy of target word recognition for the related word pairs...

This paper improves upon the state of the art in testing word oriented memories. It first presents a complete set of fault models for intra-word coupling faults. Then, it establishes the data background sequence (DBS) for each intraword coupling fault. These DBSs will be compiled into a (1+ 28 blog2Bc) n B test with complete fault coverage of the target faults, where n is the size of the memory...

We analyze skip-gram with negative-sampling (SGNS), a word embedding method introduced by Mikolov et al., and show that it is implicitly factorizing a word-context matrix, whose cells are the pointwise mutual information (PMI) of the respective word and context pairs, shifted by a global constant. We find that another embedding method, NCE, is implicitly factorizing a similar matrix, where each...

A word w is said to contain the pattern P if there is a way to substitute a nonempty word for each letter in P so that the resulting word is a subword of w. Bean, Ehrenfeucht and McNulty and, independently, Zimin characterised the patterns P which are unavoidable, in the sense that any sufficiently long word over a fixed alphabet contains P . Zimin’s characterisation says that a pattern is unav...

A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Černy had found in 1964 a sequence of n-state complete DFA with shortest synchronizing word of length (n − 1). He had conjectured that it is an upper bound for the length of the shortest synchronizing word for any n-state comp...