Choosing Word Occurrences for the Smallest Grammar Problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Choosing Word Occurrences for the Smallest Grammar Problem

Résumé

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 to focus on the choice of the occurrences to be rewritten by non-terminals. We extend classical offline algorithms by introducing a global optimization of this choice at each step of the algorithm. This approach allows us to define the search space of a smallest grammar by separating the choice of the non-terminals and the choice of their occurrences. We propose a second algorithm that performs a broader exploration by allowing the removal of useless words that were chosen previously. Experiments on a classical benchmark show that our algorithms consistently find smaller grammars then state-of-the-art algorithms.
Fichier non déposé

Dates et versions

inria-00476840 , version 1 (27-04-2010)

Identifiants

  • HAL Id : inria-00476840 , version 1

Citer

Rafael Carrascosa, François Coste, Matthias Gallé, G. Infante-Lopez. Choosing Word Occurrences for the Smallest Grammar Problem. LATA, May 2010, Trier, Germany. ⟨inria-00476840⟩
168 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More