19 search results - page 2 / 4 » Approximate Stroke Sequence String Matching Algorithm for Ch... |
ICDAR
2011
IEEE
12 years 5 months ago
2011
IEEE
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
SAC
2005
ACM
13 years 11 months ago
2005
ACM
We investigate the problem of evaluating the performance of text processing algorithms on inputs that contain errors as a result of optical character recognition. A new hierarchic...
FUIN
2006
13 years 5 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
ICDAR
1999
IEEE
13 years 10 months ago
1999
IEEE
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
CHI
1993
ACM
13 years 9 months ago
1993
ACM
We describe pictographic naming, a new approach to naming for pen-based computers, in which filenames are pictures rather than ASCII strings. Handwriting recognition (HWX) of a n...