The smallest grammar problem as constituents choice and minimal grammar parsing

DOI10.3390/a4040262zbMath1461.68096OpenAlexW2120469941MaRDI QIDQ1736491

Gabriel Infante-Lopez, Matthias Gallé, François Coste, Rafael Carrascosa

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a4040262

zbMATH Keywords

smallest grammar problemoptimal parsingdata discoveryhierarchical structure inference

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Related Items (1)

\(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient learning of context-free grammars from positive structural examples
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Linear-time text compression by longest-first substitution
• The Smallest Grammar Problem
• Choosing Word Occurrences for the Smallest Grammar Problem
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Algorithms on Strings, Trees and Sequences
• Grammar-based codes: a new class of universal lossless source codes

This page was built for publication: The smallest grammar problem as constituents choice and minimal grammar parsing