Everything about Grammar-based code
Lossless data compression algorithm
Grammar-based codes or grammar-based compression are compression algorithms based on the idea of constructing a context-free grammar (CFG) for the string to be compressed. Examples include universal lossless data compression algorithms. To compress a data sequence, a grammar-based code transforms into a context-free grammar . The problem of finding a smallest grammar for an input sequence is known to be NP-hard, so many grammar-transform algorithms are proposed from theoretical and practical viewpoints. Generally, the produced grammar is further compressed by statistical encoders like arithmetic coding. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Grammar-based codeA 5-minute orientation
- Pick up a classic book: Natural Language Processing and Information SystemsThe most-reprinted book on the subject
- Read the landmark paper: A Grammar-Based Structural CNN Decoder for Code GenerationCited 80 times
- Go sideways: Straight-line grammarA closely related topic
- Go sideways: Grammar inductionA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A Grammar-Based Structural CNN Decoder for Code Generation
A Universal Grammar-Based Code for Lossless Compression of Binary Trees
Grammar-based compression of interpreted code
Code- Switching as a Language Teaching Strategy Based on the Grammar- Translation Method for Comprehension Enhancement
Self-Adaptive Code Representation: Grammar-Guided or Token-Based?
Straight quotes, square brackets: Page-based poetics inflected with the syntax and grammar of code languages
đź“š Books worth reading
Natural Language Processing and Information SystemsElisabeth Métais · 2005
Introduction to psycholinguisticsMatthew J. Traxler · 2011
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Theory and Practice of ComputationShin-ya Nishizaki · 2013
Teaching and ResearchingRebecca L. Oxford · 2013
Genetic ProgrammingKrzysztof Krawiec · 2013
Digital planetGeorge Beekman, Ben Beekman · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Straight-line grammar A straight-line grammar (SLG) is a formal grammar that generates exactly one string. Consequently, it does not branch (every non-terminal has only one…
- Grammar induction Grammar induction (or grammatical inference) is the process in machine learning of learning a formal grammar (usually as a collection of re-write rules…
- LZ77 and LZ78 LZ77 and LZ78 are the two lossless data compression algorithms published in papers by Abraham Lempel and Jacob Ziv in 1977 and 1978. They are also known…
- Data compression In information theory, data compression, source coding, or bit-rate reduction is the process of encoding information using fewer bits than the original…
- Image compression Image compression is a type of data compression applied to digital images, to reduce their cost for storage or transmission. Algorithms may take advantage…
- Lossless compression Lossless compression is a class of data compression that allows the original data to be perfectly reconstructed from the compressed data with no loss of…
- Smallest grammar problem In data compression and the theory of formal languages, the smallest grammar problem is the problem of finding the smallest context-free grammar that generates…
- Slepian–Wolf coding In information theory and communication, the Slepian–Wolf coding, also known as the Slepian–Wolf bound, is a result in distributed source coding discovered…