(s,c)-dense coding: an optimized compression code for natural language text databases.

DOI10.1007/B14038MaRDI QIDQ5897136zbMATH OpenOpenAlexFDO

Authors Nieves R. Brisaboa, Antonio Fariña, María F. Esteller, Gonzalo Navarro

Publication date 9 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b14038

Mathematics Subject Classification ID

Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• scientific article; zbMATH DE number 1975048
• New word-based adaptive dense compressors
• ODC: frame for definition of dense codes
• String Processing and Information Retrieval
• Improving semistatic compression via pair-based coding

Cited in

(23)

• New bounds on \(D\)-ary optimal codes
• Towards efficient positional inverted index
• Compressed matching in dictionaries
• ODC: frame for definition of dense codes
• An efficient variable-to-fixed length encoding using multiplexed parse trees
• Compressed matching for feature vectors
• Random access to Fibonacci encoded files
• Improving semistatic compression via pair-based coding
• Accelerating Boyer Moore Searches on Binary Texts
• Compressing annotated natural language text
• New word-based adaptive dense compressors
• scientific article; zbMATH DE number 1975048 (Why is no real title available?)
• scientific article; zbMATH DE number 1975049 (Why is no real title available?)
• Practical fixed length Lempel-Ziv coding
• Bicriteria data compression
• Text and hypertext compression
• A fast dynamic compression scheme for natural language texts
• Natural-Language Text Compression Using Reverse Multi-Delimiter Codes
• Lossless text compression by means of binary-coded ternary number representation
• Binary mixed-digit data compression codes
• Huffman coding with non-sorted frequencies
• Accelerating Boyer-Moore searches on binary texts
• A general compression algorithm that supports fast searching

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)