Sciweavers

1028 search results - page 15 / 206
» Character sets of strings
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
A new radical-based approach to online handwritten Chinese character recognition
This paper proposes a new radical-based approach for online handwritten Chinese character recognition. The approach is novel in three respects: statistical classification of radic...
Long-Long Ma, Cheng-Lin Liu
ACL
1998
13 years 9 months ago
Japanese OCR Error Correction using Character Shape Similarity and Statistical Language Model
We present a novel OCR error correction method for languages without word delimiters that have a large character set, such as Japanese and Chinese. It consists of a statistical OC...
Masaaki Nagata
MST
2006
104views more  MST 2006»
13 years 7 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
SPIRE
2005
Springer
14 years 1 months ago
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
Heikki Hyyrö
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson