Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
| Hi-index | 0.00 |
The goal of the project was to design and implement an English word-list representation suitable for spell-checking in space-constrained environments. The compression algorithm was derived by statistically analyzing the word list. A compression ratio of 18% was achieved through a combination of prefix and suffix encoding. The compressed file can be randomly accessed by prefix marker positions. A simple spell-checker based on the encoding was implemented and tested in Java. Copyright © 2005 John Wiley & Sons, Ltd.