Presentation 1995/5/12
Lossy Text Compression for String Pattern Matching
Shuichi Fukamachi, Shinichi Shimozono, Hiroki Arimura, Takeshi Shinohara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A mapping, called k-indexing, from an alphabet to a smaller alphabet of size k is considered as a lossy text compression for speeding up string pattern matching. An approximation algorithm to find a k-indexing that minimizes false detection is presented. Using optimized 2^n-indexing, texts can be compressed in fixed length code of n (bit/char) and the expectation of false detection for patterns of length l is roughly <1/2>^. Optimized indexings for symbols, 2-grams, and 3-grams are compared with each other on the actual English text.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) information retrieval / data compression / string pattern matching / approximation
Paper #
Date of Issue

Conference Information
Committee NLC
Conference Date 1995/5/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Natural Language Understanding and Models of Communication (NLC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Lossy Text Compression for String Pattern Matching
Sub Title (in English)
Keyword(1) information retrieval
Keyword(2) data compression
Keyword(3) string pattern matching
Keyword(4) approximation
1st Author's Name Shuichi Fukamachi
1st Author's Affiliation Department of Artificial Intelligence Kyushu Institute of Technology()
2nd Author's Name Shinichi Shimozono
2nd Author's Affiliation Department of Control Engineering and Science Kyushu Institute of Technology
3rd Author's Name Hiroki Arimura
3rd Author's Affiliation Department of Artificial Intelligence Kyushu Institute of Technology
4th Author's Name Takeshi Shinohara
4th Author's Affiliation Department of Artificial Intelligence Kyushu Institute of Technology
Date 1995/5/12
Paper #
Volume (vol) vol.95
Number (no) 29
Page pp.pp.-
#Pages 8
Date of Issue