Please use this identifier to cite or link to this item:
|Title:||Text compression via alphabet re-representation|
|Authors:||Long, P.M. |
|Citation:||Long, P.M., Natsev, A.I., Vitter, J.S. (1999). Text compression via alphabet re-representation. Neural Networks 12 (4-5) : 755-765. ScholarBank@NUS Repository. https://doi.org/10.1016/S0893-6080(99)00022-2|
|Abstract:||This article introduces the concept of alphabet re-representation in the context of text compression. We consider re-representing the alphabet so that a representation of a character reflects its properties as a predictor of future text. This enables us to use an estimator from a restricted class to map contexts to predictions of upcoming characters. We describe an algorithm that uses this idea in conjunction with neural networks. The performance of our implementation is compared to other compression methods, such as UNIX compress, gzip, PPMC, and an alternative neural network approach.|
|Source Title:||Neural Networks|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 17, 2018
WEB OF SCIENCETM
checked on Oct 9, 2018
checked on Oct 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.