.png){kind=icon}
.png){kind=icon}
Return
The fractional greedy algorithm for data compression
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02238290.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Text-compression problems are considered where substrings are substituted by code-words according to a static dictionary such that the original text is encoded by a shorter code sequence. We introduce a new efficient on-line heuristic which locally maximizes the compaction ratio. The worst-case behaviour of this fractional greedy heuristic is investigated for several types of dictionaries.
Keywords:
optimal and heuristic encoding
shortest paths
textual substitution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.