The smallest grammar problem as constituents choice and minimal grammar parsing

DOI10.3390/A4040262MaRDI QIDQ1736491zbMATHOpenAlexFDO

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

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)

Recommendations

• Choosing word occurrences for the smallest grammar problem
• Searching for smallest grammars on large sequences and application to DNA
• The Smallest Grammar Problem
• On the complexity of the smallest grammar problem over fixed alphabets
• The smallest grammar problem revisited

Cites work

• scientific article; zbMATH DE number 3468267 (Why is no real title available?)
• scientific article; zbMATH DE number 1045405 (Why is no real title available?)
• scientific article; zbMATH DE number 1149447 (Why is no real title available?)
• scientific article; zbMATH DE number 1445329 (Why is no real title available?)
• A universal algorithm for sequential data compression
• Algorithms on Strings, Trees and Sequences
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Choosing word occurrences for the smallest grammar problem
• Compression of individual sequences via variable-rate coding
• Efficient learning of context-free grammars from positive structural examples
• Grammar-based codes: a new class of universal lossless source codes
• Linear-time text compression by longest-first substitution
• The Smallest Grammar Problem

Cited in

(6)

• Choosing word occurrences for the smallest grammar problem
• On the complexity of the smallest grammar problem over fixed alphabets
• scientific article; zbMATH DE number 1400022 (Why is no real title available?)
• Searching for smallest grammars on large sequences and application to DNA
• \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity
• Minimalist Grammar Transition-Based Parsing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736491)