Compressed Matching in Dictionaries
AbstractThe problem of compressed pattern matching, which has recently been treated in many papers dealing with free text, is extended to structured files, specifically to dictionaries, which appear in any full-text retrieval system. The prefix-omission method is combined with Huffman coding and a new variant based on Fibonacci codes is presented. Experimental results suggest that the new methods are often preferable to earlier ones, in particular for small files which are typical for dictionaries, since these are usually kept in small chunks. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Klein, S.T.; Shapira, D. Compressed Matching in Dictionaries. Algorithms 2011, 4, 61-74.
Klein ST, Shapira D. Compressed Matching in Dictionaries. Algorithms. 2011; 4(1):61-74.Chicago/Turabian Style
Klein, Shmuel T.; Shapira, Dana. 2011. "Compressed Matching in Dictionaries." Algorithms 4, no. 1: 61-74.