On Bit-Parallel Processing of Multi-byte Text

There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The bit-parallel algorithms typically use a size-σ table of match bit-vectors, where the bits in the vector for a character λ identify the positions where the character λ occurs in one of the processed strings, and σ is the alphabet size. The time or space cost of computing the match table is not prohibitive with reasonably small alphabets such as ASCII text. However, for example in the case of general Unicode text the possible numerical code range of the characters is roughly one million. This makes using a simple table impractical. In this paper we evaluate three different schemes for overcoming this problem. First we propose to replace the character code table by a character code automaton. Then we compare this method with two other schemes: using a hash table, and the binary-search based solution proposed...

• Type: Conference
• Year: 2004
• Where: AIRS
• Authors: Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda
• Keywords: AIRS 2004, Bit-parallel Algorithms, Character Code Table, Hash Table, Information Retrieval