Compressed Matching in Dictionaries

Shmuel T. Klein; Dana Shapira

doi:10.3390/a4010061

Compressed Matching in Dictionaries

Shmuel T. Klein, Dana Shapira

Department of Computer Science

Ashkelon Academic College

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

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.

Original language	English
Pages (from-to)	61-74
Number of pages	14
Journal	Algorithms
Volume	4
Issue number	1
DOIs	https://doi.org/10.3390/a4010061
State	Published - Mar 2011

Keywords

Compressed matching
Dictionaries
Fibonacci codes
Huffman codes
IR systems
Pattern matching

Access to Document

10.3390/a4010061

Cite this

@article{336162a791fd433c8735fc7a98925cdd,

title = "Compressed Matching in Dictionaries",

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 = "Compressed matching, Dictionaries, Fibonacci codes, Huffman codes, IR systems, Pattern matching",

author = "Klein, {Shmuel T.} and Dana Shapira",

year = "2011",

month = mar,

doi = "10.3390/a4010061",

language = "אנגלית",

volume = "4",

pages = "61--74",

journal = "Algorithms",

issn = "1999-4893",

publisher = "MDPI AG",

number = "1",

}

TY - JOUR

T1 - Compressed Matching in Dictionaries

AU - Klein, Shmuel T.

AU - Shapira, Dana

PY - 2011/3

Y1 - 2011/3

N2 - 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.

AB - 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.

KW - Compressed matching

KW - Dictionaries

KW - Fibonacci codes

KW - Huffman codes

KW - IR systems

KW - Pattern matching

UR - http://www.scopus.com/inward/record.url?scp=84859058234&partnerID=8YFLogxK

U2 - 10.3390/a4010061

DO - 10.3390/a4010061

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84859058234

SN - 1999-4893

VL - 4

SP - 61

EP - 74

JO - Algorithms

JF - Algorithms

IS - 1

ER -

Compressed Matching in Dictionaries

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this