An upper- and lowercase alphabetic similarity matrix, with derived generation similarity values

Synthetic Similarity Matrix Generation

Alphabetic Letter Perceivability, Similarity, and Bias

The similarity of the letters in the Latin alphabet has been measured numerous times using a variety of methodologies and stimuli. We provide a comprehensive review of past attempts to construct similarity spaces of the Latin alphabet, and determine that accuracy has frequently been attributed to a subset of three common sources: perceivability, bias, and similarity. We present the results of t...

Alphabetic letter identification: effects of perceivability, similarity, and bias.

The legibility of the letters in the Latin alphabet has been measured numerous times since the beginning of experimental psychology. To identify the theoretical mechanisms attributed to letter identification, we report a comprehensive review of literature, spanning more than a century. This review revealed that identification accuracy has frequently been attributed to a subset of three common s...

TOPOLOGICAL SIMILARITY OF L-RELATIONS

$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...

The Lanczos-Ritz values appearing in an orthogonal similarity reduction of a matrix into semiseparable form

It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation into tridiagonal form. Once the tridiagonal matrix has been computed, several algorithms can be used to compute either the whole spectrum or part of it. In this paper, we propose an algorithm to reduce any symmetric matrix into a similar semiseparable one of semiseparability rank 1, by orthogonal...