An analysis of the longest match and the greedy heuristics in text encoding (Q4302811)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An analysis of the longest match and the greedy heuristics in text encoding |
scientific article; zbMATH DE number 622294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An analysis of the longest match and the greedy heuristics in text encoding |
scientific article; zbMATH DE number 622294 |
Statements
An analysis of the longest match and the greedy heuristics in text encoding (English)
0 references
13 November 1994
0 references
optimal encoding
0 references
shortest paths
0 references
textual substitution
0 references
text compression
0 references
heuristic encoding
0 references
dictionaries
0 references
0.8598429560661316
0 references
0.8296287059783936
0 references
