The Chinese language is based on characters which are syllabic in nature. Since languages have syllabotactic rules which govern the construction of syllables and their allowed sequences, Chinese character sequence models can be used as a first level approximation of allowed syllable sequences. N -gram character sequence models were trained on 4.3 billion characters. Characters are used as a fir...

This paper presents a new insight into character recognition problem. Implicit polynomial (IP) curves have been used for modelling characters. A unique decomposition theorem is employed to decompose these curves into simple line primitives. For the comparison of the characters, canonical invariants have been computed using so called “related points” of the curves, which are the real intersectio...

‎in [u‎. ‎dempwolff‎, ‎on extensions of elementary abelian groups of order $2^{5}$ by $gl(5,2)$‎, ‎textit{rend‎. ‎sem‎. ‎mat‎. ‎univ‎. ‎padova}‎, ‎textbf{48} (1972)‎, ‎359‎ - ‎364.] dempwolff proved the existence of a group of the‎ ‎form $2^{5}{^{cdot}}gl(5,2)$ (a non split extension of the‎ ‎elementary abelian group $2^{5}$ by the general linear group‎ ‎$gl(5,2)$)‎. ‎this group is the second l...

In this paper, a novel approach for printed character recognition using linear symmetry is proposed. When the conventional character recognition methods such as the arti1cial neural network based techniques are used to recognise Brahmi Sinhala script, segmentation of modi1ed characters into modi1er symbols and basic characters is a necessity but a complex issue. The large size of the character ...