Skip to Main content Skip to Navigation
Journal articles

The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing

Rafael Carrascosa 1 François Coste 2 Matthias Gallé 2 Gabriel Infante-Lopez 1
1 Equipe d'Informatique Linguistique - Grupo de Procesamiento de Lenguaje Natural (PLN)
LIGM - Laboratoire d'Informatique Gaspard-Monge, FaMAF - Facultad de Matemática, Astronomía y Física [Cordoba]
2 SYMBIOSE - Biological systems and models, bioinformatics and sequences
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : 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 into two tasks: (1) choosing which words will be the constituents of the grammar and (2) searching for the smallest grammar given this set of constituents. We show how to solve the second task in polynomial time parsing longer constituent with smaller ones. We propose new algorithms based on classical practical algorithms that use this optimization to find small grammars. Our algorithms consistently find smaller grammars on a classical benchmark reducing the size in 10% in some cases. Moreover, our formulation allows us to define interesting bounds on the number of small grammars and to empirically compare different grammars of small size.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : François Coste Connect in order to contact the contributor
Submitted on : Friday, November 4, 2011 - 5:50:26 PM
Last modification on : Thursday, January 20, 2022 - 5:29:51 PM
Long-term archiving on: : Sunday, February 5, 2012 - 2:29:25 AM


Publisher files allowed on an open archive



Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel Infante-Lopez. The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing. Algorithms, MDPI, 2011, pp.262-284. ⟨10.3390/a4040262⟩. ⟨inria-00638445⟩



Les métriques sont temporairement indisponibles