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...
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
We propose script-specific post processing schemes for improving the recognition rate of online Tamil characters. At the first level, features derived at each sample point of the ...
This paper deals with a new method for recognition of offline Handwritten noncompound Devnagari Characters in two stages. It uses two well known and established pattern recognitio...
Sandhya Arora, Debotosh Bhattacharjee, Mita Nasipu...