Abstract
A framework of context-sensitive grammar transform is proposed. A greedy compression algorithm with the transform model is presented as well as a Knuth-Morris-Pratt (KMP)-type compressed pattern matching (CPM) algorithm. The compression performance is a match for gzip and Re-Pair. 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. (2000), and in the case of short patterns, faster than the Boyer-Moore-Horspool algorithm with the stopper encoding by Rautio et al. (2002), which is regarded as one of the best combinations that allows a practically fast search. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Maruyama, S., Tanaka, Y., Sakamoto, H., & Takeda, M. (2008). Context-sensitive grammar transform: Compression and pattern matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5280 LNCS, pp. 27–38). Springer Verlag. https://doi.org/10.1007/978-3-540-89097-3_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
