Sciweavers

39 search results - page 4 / 8
» Tree Compression Using String Grammars
Sort
View
DAGSTUHL
2006
13 years 7 months ago
Program Compression
Abstract. The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store an...
William S. Evans
ACL
2011
12 years 9 months ago
Using Derivation Trees for Treebank Error Detection
This work introduces a new approach to checking treebank consistency. Derivation trees based on a variant of Tree Adjoining Grammar are used to compare the annotation of word sequ...
Seth Kulick, Ann Bies, Justin Mott
IBPRIA
2011
Springer
12 years 9 months ago
Classifying Melodies Using Tree Grammars
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
José Francisco Bernabeu, Jorge Calera-Rubio...
CL
2000
Springer
13 years 5 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
13 years 11 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai