Abstract Although the Latin-based orthographies of most Western languages employ vowels with accent marks (e.g., é vs. e), extant models letter and word recognition are agnostic as to whether these accented letters their non-accented counterparts represented by common or separate abstract units. Recent research in French a masked priming alphabetic decision task was interpreted favoring idea th...

A study investigating the way in which people solve alphabetic analogical reasoning tasks (cf Copycat; Hofstadter & Mitchell, 1995), revealed that participants tend to use the same basic strategy, which was modelled in the cognitive architecture ACT-R. Performance evaluations indicate an average goodness of fit of 66.75% and a 100% goodness of fit on a subset of problems for which participants ...

An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing ∑n i=1w(i)l(i), this variant involves minimizing loga ∑n i=1 w(i)a l(i) for a given a ∈ (0, 1). This note introduces a dynamic programming algorithm that finds...

standardizing persian alphabet letters in pcs, note books and cell phones is an important issue in persian writing. diversity of letters assigned to a given key as well as inappropriateness of the assigned letters to keys in relation to the frequency of letters are the most important issues for the iranians using persian keyboards. although the standard persian keyboard has been organized in a ...

We give a new algorithm to construct optimal alphabetic ternary trees, where every internal node has at most three children. This algorithm generalizes the classic Hu-Tucker algorithm, though the overall computational complexity has yet to be determined.

We describe a modiication of the Hu{Tucker algorithm for constructing an optimal alphabetic tree that runs in O(n) time for several classes of inputs. These classes can be described in simple terms and can be detected in linear time. We also give simple conditions and a linear algorithm for determining, in some cases, if two adjacent nodes will be combined in the optimal alphabetic tree.

Word and pseudoword reading are related abilities that are fundamental to reading development in alphabetic orthographies. They are respectively assumed to index children’s orthographic representations of words as acquired through the underlying ‘self-teaching mechanism’ of alphabetic pseudoword decoding. However, little is known about the concurrent growth trajectories of these skills in the e...

We show how to build an alphabetic minimax tree for a sequence W = w1, . . . , wn of real weights in O(nd log logn) time, where d is the number of distinct integers ⌈wi⌉. We apply this algorithm to building an alphabetic prefix code given a sample.