Open AccessThis article is
- freely available
Compressed Matching in Dictionaries
Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel
Department of Computer Science, Ashkelon Academic College, Ashkelon, Israel
* Author to whom correspondence should be addressed.
Received: 30 January 2011; in revised form: 2 March 2011 / Accepted: 17 March 2011 / Published: 22 March 2011
Abstract: The 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.
Keywords: dictionaries; IR systems; pattern matching; compressed matching; Huffman codes; Fibonacci codes
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
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.
Klein, Shmuel T.; Shapira, Dana. 2011. "Compressed Matching in Dictionaries." Algorithms 4, no. 1: 61-74.