Character (mathematics)

About: Character (mathematics) is a research topic. Over the lifetime, 46723 publications have been published within this topic receiving 411412 citations.

Document character reading system

Abstract: A character reading system which reduces the amount of correction and verification work needed for a document for which characters have been correctly recognized. Whole image data WIMG of a document read by a remote OCR installed at a local station and first character data DATA1 recognized on the basis of a first character recognition method from this data WIMG are stored via a communication network in a memory component provided to a central station. A second recognition component provided to the central station recognizes second character data on the basis of a second character recognition method that is different from the first character recognition method from the image data WIMG read out from the memory component. A decision component decides whether there is a match between these first and second sets of character data. If there is a match, the data is outputted as correct character data, that is, third character data, to a host computer. If there is a mismatch, the data is changed to correct character data by a correction component, and, if needed, this correction is verified, after which the data is outputted as corrected correct character data to the host computer.

Character-based PSMT for Closely Related Languages

Abstract: Translating unknown words between related languages using a character-based statistical machine translation model can be beneficial. In this paper, we describe a simple method to combine character-based models with standard word-based models to increase the coverage of a phrase-based SMT system. Using this approach, we can show a modest improvement when translating between Norwegian and Swedish. The potentials of applying character-based models to closely related languages is also illustrated by applying the character model on its own. The performance of such an approach is similar to the word-level baseline and closer to the reference in terms of string similarity.

Character-based correction arrangement with correction propagation

Abstract: A method of correcting a text in a data processing system is described. The method includes the step of locating a first incorrect character in the text. A character list of alternative characters for the first incorrect character is then shown to the user who replaces the first incorrect character with a correct character from the character list. The change of the first incorrect character is then propagated through a remainder of the text in accordance with a matching score and a language probability score of the remainder of the text with respect to the correct character to correct any subsequent incorrect character in the text.

Universal Characters and an Extension of the KP Hierarchy

Abstract: The universal character is a polynomial attached to a pair of partitions and is a generalization of the Schur polynomial. In this paper, we define vertex operators which play roles of raising operators for the universal character. By means of the vertex operators, we obtain a series of non-linear partial differential equations of infinite order, called the UC hierarchy; we regard it as an extension of the KP hierarchy. We investigate also solutions of the UC hierarchy; the totality of the space of solutions forms a direct product of two infinite-dimensional Grassmann manifolds, and its infinitesimal transformations are described in terms of the Lie algebra .