Context-sensitive grammar transform: Compression and pattern matching

Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


A framework of context-sensitive grammar transform for speeding-up compressed pattern matching (CPM) is proposed. A greedy compression algorithm with the transform model is presented as well as a Knuth-Morris-Pratt (KMP)-type compressed pattern matching algorithm. The compression ratio is a match for gzip and Re-Pair, and the search speed of our CPM algorithm is almost twice faster than the KMP-type CPM algorithm on Byte-Pair-Encoding by Shibata et al. [18], and in the case of short patterns, faster than the Boyer-Moore-Horspool algorithm with the stopper encoding by Rautio et al. [14], which is regarded as one of the best combinations that allows a practically fast search.

Original languageEnglish
Pages (from-to)219-226
Number of pages8
JournalIEICE Transactions on Information and Systems
Issue number2
Publication statusPublished - 2010

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'Context-sensitive grammar transform: Compression and pattern matching'. Together they form a unique fingerprint.

Cite this