An overhead reduction technique for mega-state compression schemes |
| |
| Authors: | Abraham Bookstein Shmuel T Klein Timo Raita |
| |
| Institution: | 1University of Chicago, 1010 E. 59 St., Chicago, IL 60637, USA;2Department of Mathematics & Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel;3Computer Science Department, University of Turku, 20520 Turku, Finland |
| |
| Abstract: | Many of the most effective compression methods involve complicated models. Unfortunately, as model complexity increases, so does the cost of storing the model itself. This paper examines a method to reduce the amount of storage needed to represent a Markov model with an extended alphabet, by applying a clustering scheme that brings together similar states. Experiments run on a variety of large natural language texts show that much of the overhead of storing the model can be saved at the cost of a very small loss of compression efficiency. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
