Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
We present a pipelined approach to hardware implementation of the Aho-Corasick (AC) algorithm for string matching called P-AC. By incorporating pipelined processing, the state grap...
This paper describes a handwritten character string recognition system for Japanese mail address reading on very large vocabulary. The address phrases are recognized as a whole bec...