Next Article in Journal
Approximating the Minimum Tour Cover of a Digraph
Previous Article in Journal
Edit Distance with Block Deletions
Algorithms 2011, 4(1), 61-74; doi:10.3390/a4010061

Compressed Matching in Dictionaries

1,*  and 2
1 Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel 2 Department of Computer Science, Ashkelon Academic College, Ashkelon, Israel
* Author to whom correspondence should be addressed.
Received: 30 January 2011 / Revised: 2 March 2011 / Accepted: 17 March 2011 / Published: 22 March 2011
View Full-Text   |   Download PDF [185 KB, uploaded 22 March 2011]


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 dictionaries; IR systems; pattern matching; compressed matching; Huffman codes; Fibonacci codes
This is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Klein, S.T.; Shapira, D. Compressed Matching in Dictionaries. Algorithms 2011, 4, 61-74.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert