loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC '96)
Parsing with suffix and prefix dictionaries
Snowbird, UT
March 31-April 03
ISBN: 0-8186-7358-3
M. Cohn, Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA
R. Khazan, Dept. of Comput. Sci., Brandeis Univ., Waltham, MA, USA
We show that greedy left-to-right (right-to-left) parsing is optimal w.r.t. a suffix (prefix) dictionary. To exploit this observation, we show how to construct a static suffix dictionary that supports on-line, linear-time optimal parsing. From this we derive an adaptive on-line method that yields compression comparing favorably to LZW.
Index Terms:
grammars; data compression; adaptive signal processing; prefix dictionaries; suffix dictionaries; parsing; greedy left to right parsing; greedy right to left parsing; static suffix dictionary; adaptive online method; LZW dictionary
Citation:
M. Cohn, R. Khazan, "Parsing with suffix and prefix dictionaries," dcc, pp.180, Data Compression Conference (DCC '96), 1996
Usage of this product signifies your acceptance of the Terms of Use.