(s,c)-dense coding: an optimized compression code for natural language text databases.
From MaRDI portal
(Redirected from Publication:5897136)
\((s,c)\)-dense coding: an optimized compression code for natural language text databases.
\((s,c)\)-dense coding: an optimized compression code for natural language text databases.
Recommendations
Cited in
(23)- New word-based adaptive dense compressors
- New bounds on \(D\)-ary optimal codes
- Accelerating Boyer-Moore searches on binary texts
- A general compression algorithm that supports fast searching
- scientific article; zbMATH DE number 1975049 (Why is no real title available?)
- Compressing annotated natural language text
- An efficient variable-to-fixed length encoding using multiplexed parse trees
- Compressed matching for feature vectors
- scientific article; zbMATH DE number 1975048 (Why is no real title available?)
- Compressed matching in dictionaries
- ODC: frame for definition of dense codes
- Huffman coding with non-sorted frequencies
- Random access to Fibonacci encoded files
- Improving semistatic compression via pair-based coding
- Towards efficient positional inverted index
- A fast dynamic compression scheme for natural language texts
- Accelerating Boyer Moore Searches on Binary Texts
- Practical fixed length Lempel-Ziv coding
- Bicriteria data compression
- Natural-Language Text Compression Using Reverse Multi-Delimiter Codes
- Lossless text compression by means of binary-coded ternary number representation
- Text and hypertext compression
- Binary mixed-digit data compression codes
This page was built for publication: \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897136)