Sciweavers

1028 search results - page 25 / 206
» Character sets of strings
Sort
View
FUIN
2006
98views more  FUIN 2006»
13 years 7 months ago
On-line Approximate String Matching in Natural Language
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...
Kimmo Fredriksson
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
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...
Heikki Hyyrö, Gonzalo Navarro
SPIRE
2010
Springer
13 years 6 months ago
Succinct Representations of Dynamic Strings
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...
Meng He, J. Ian Munro
ICDAR
2009
IEEE
14 years 2 months ago
An Improved Online Tamil Character Recognition Engine Using Post-Processing Methods
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 ...
Suresh Sundaram, Angarai Ganesan Ramakrishnan
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Recognition of Non-Compound Handwritten Devnagari Characters using a Combination of MLP and Minimum Edit Distance
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...