The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing

The smallest grammar problem—namely, finding a smallest context-free grammar that generates exactly one sequence—is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and pattern discovery. We propose a new perspective on this problem by splitting it in...

Descripció completa

Dades bibliogràfiques

Autors principals:	Gabriel Infante-Lopez, Rafael Carrascosa, Matthias Gallé, François Coste
Format:	Artigo
Idioma:	Inglês
Publicat:	MDPI AG 2011-10-01
Col·lecció:	Algorithms
Matèries:	smallest grammar problem hierarchical structure inference optimal parsing data discovery
Accés en línia:	http://www.mdpi.com/1999-4893/4/4/262/
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!