The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing | ||
| dc.conicet.organizacion | Universidad Nacional de Córdoba | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba | |
| dc.conicet.organizacion | Institut National de Recherche en Informatique et en Automatique | |
| dc.conicet.organizacion | Institut National de Recherche en Informatique et en Automatique | |
| dc.conicet.organizacion | Universidad Nacional de Córdoba | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba | |
| dc.contributor.author | Carrascosa, Rafael | |
| dc.contributor.author | Coste, François | |
| dc.contributor.author | Galle, Matthias | |
| dc.contributor.author | Infante Lopez, Gabriel Gaston | |
| dc.date.issued | 2011-10 | |
| dc.description.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. | es |
| dc.description.fil | Fil: Carrascosa, Rafael. Universidad Nacional de Córdoba; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba; Argentina | |
| dc.description.fil | Fil: Coste, François. Institut National de Recherche en Informatique et en Automatique; Francia | |
| dc.description.fil | Fil: Galle, Matthias. Institut National de Recherche en Informatique et en Automatique; Francia | |
| dc.description.fil | Fil: Infante Lopez, Gabriel Gaston. Universidad Nacional de Córdoba; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba; Argentina | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Carrascosa, Rafael; Coste, François; Galle, Matthias; Infante Lopez, Gabriel Gaston; The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing; MDPI; Algorithms; 4; 4; 10-2011; 262-284 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 1999-4893 | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/193597 | |
| dc.journal.number | 4 | es |
| dc.journal.pagination | 262-284 | es |
| dc.journal.pais | Estados Unidos | es |
| dc.journal.title | Algorithms | es |
| dc.journal.volume | 4 | es |
| dc.language.iso | eng | es |
| dc.publisher | MDPI | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/http://www.mdpi.com/1999-4893/4/4/262/ | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.3390/a4040262 | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | * |
| dc.subject | DATA DISCOVERY | es |
| dc.subject | HIERARCHICAL STRUCTURE INFERENCE | es |
| dc.subject | OPTIMAL PARSING | es |
| dc.subject | SMALLEST GRAMMAR PROBLEM | es |
| dc.subject.classification | Otras Ciencias de la Computación e Información | es |
| dc.subject.classification | Ciencias de la Computación e Información | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.dd68fc72-4bea-4b03-abd9-ac9cac185811_B.pdf
- Tamaño:
- 536.27 KB
- Formato:
- Adobe Portable Document Format