24,983 Hits in 2.2 sec

Grammatical codes of trees

A. Ehrenfeucht, G. Rozenberg
1991 Discrete Applied Mathematics  
Rozenberg, Grammatical codes of trees, Discrete Applied Mathematics 32 (1991) 103-129.  ...  The problem of coding (chain free) trees by words where the length of the word coding a tree t equals the number of leaves of t is investigated.  ...  Salomaa for very useful comments on the previous version of this paper, and to Ms. M. van der Nat for the expert typing of this paper.  ... 
doi:10.1016/0166-218x(91)90095-e fatcat:veangltf2bhazpegg5k63z4diu

Properties of grammatical codes of trees

A. Ehrenfeucht, P. ten Pas, G. Rozenberg
1994 Theoretical Computer Science  
Rozenberg, Properties of grammatical codes of trees, Theoretical Computer Science 125 (1994) 259-293. In this paper grammatical codes of trees are investigated.  ...  In particular, it is shown how to extend grammatical codes of trees to node-labeled trees, and the case of binary trees (forests) is studied.  ...  Salomaa for very useful comments concerning the previous versions of this paper. The research presented here has been carried out within the framework of ESPRIT BRA Action "ASMICS".  ... 
doi:10.1016/0304-3975(92)00079-7 fatcat:pooevam4fvdz5glkmy45mw36vu

A note on binary grammatical codes of trees

Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg
1996 Theoretical Computer Science  
Grammatical codes of trees provide a way to encode ordered trees into strings over a finite alphabet in such a way that the length of each code-word is precisely the number of leaves of the coded tree.  ...  The second topic (see Section 3) concerns the extension of binary grammatical codes to grammatical codes for trees of arbitrary degree.  ...  For each binary grammatical code cp, the extension pext is a grammatical code for the set of chain-free trees.  ... 
doi:10.1016/0304-3975(95)00093-3 fatcat:p3om5rpqi5ga3agjjtvfh3ivaa

Gecco 2008 grammatical evolution tutorial

R. Muhammad Atif Azad, Conor Ryan
2008 Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation - GECCO '08  
Based on Ramped Half and Half initialisation in GP For all tree depths from 2 to maximum size Generate an equal number of trees of that size Use full for 50% Use grow for 50% Similar in GE, but  ...  Limerick) Grammatical Evolution July 12, 2008 80 / 82 The Future The Future Evolving machine code (Machine Code Grammatical Evolution - MCGE) The Grammar (Attribute Grammars) Search & Evolutionary  ... 
doi:10.1145/1388969.1389058 dblp:conf/gecco/AzadR08 fatcat:ihuz5czhdrhzdi53ttcmpmrudq

Page 3229 of Mathematical Reviews Vol. , Issue 97E [page]

1997 Mathematical Reviews  
They also discuss the extension of binary grammatical codes to grammatical codes for trees of arbitrary degree.  ...  codes of trees.  ... 

Automatic verilog code generation through grammatical evolution

Ulya R. Karpuzcu
2005 Proceedings of the 2005 workshops on Genetic and evolutionary computation - GECCO '05  
This work aims to investigate the automatic generation of Verilog code, representing digital circuits through Grammatical Evolution (GE).  ...  The program code of the individual can be detected by traversing the leaves of the tree (derivation tree) from left to right [12] .  ...  From the GP variants, DTGP and grammatically based GP suffer from extensive space consumption, because the representation (derivation tree) includes not only the generated code of an individual but also  ... 
doi:10.1145/1102256.1102346 dblp:conf/gecco/Karpuzcu05 fatcat:frc77fohwnfddk6or73spaxz54

Grammatical Framework Tutorial, with a Focus on Fenno-Ugric Languages

Aarne Ranta, Inari Listenmaa
2015 Septentrio Conference Series  
Each of these languages has a concrete syntax, which defines a relation between trees in the abstract syntax and strings in the language.  ...  A multilingual grammar has an abstract syntax, which is shared by a set of languages.  ...  For instance, we see how to deal with the rich system of participles and infinitives of Finnish in translation.  ... 
doi:10.7557/5.3456 fatcat:plo5riftzrbztkjndjaq2q4z6q

Evolutionary dynamics of language systems

Simon J. Greenhill, Chieh-Hsi Wu, Xia Hua, Michael Dunn, Stephen C. Levinson, Russell D. Gray
2017 Proceedings of the National Academy of Sciences of the United States of America  
This particular coding of grammatical structure should not be taken as representing the only way to do it.  ...  Each dataset was recoded into a binary presence or absence coding to minimize inconsistency across coding schemes, essentially asking if a given grammatical feature or lexical cognate set was present or  ... 
doi:10.1073/pnas.1700388114 pmid:29073028 pmcid:PMC5651730 fatcat:wdobb3726zgy3mtwfi74jfn7d4

Page 3200 of Mathematical Reviews Vol. , Issue 88f [page]

1988 Mathematical Reviews  
Summary: “The concept of basic tree transducers is investigated; it is obtained as a natural restriction of the concept of macro tree transducer by forbidding nesting of states.  ...  We give quantitative data on the compression of information in the coding of some context-free languages.”  ... 

Page 5546 of Mathematical Reviews Vol. , Issue 95i [page]

1995 Mathematical Reviews  
In the paper under review, the authors continue the investigation of grammatical codes of trees and, in particular, strict codes which are known to be grammatical.  ...  The length of the word coding a tree according to a strict code equals the number of leaves of the tree.  ... 

The impact of lexical and grammatical processing on generating code from natural language [article]

Nathanaël Beau, Benoît Crabbé
2022 arXiv   pre-print
Considering the seq2seq architecture of TranX for natural language to code translation, we identify four key components of importance: grammatical constraints, lexical preprocessing, input representations  ...  The paper highlights the importance of the lexical substitution component in the current natural language to code systems.  ...  The set of valid ASTs is a set of trees that are generated by an ASDL grammar (Wang et al., 1997) .  ... 
arXiv:2202.13972v2 fatcat:ysttkiutl5dsvhunhgumemiwje

Learning Micro-Planning Rules for Preventative Expressions [article]

Keith Vander Linden ; Barbara Di Eugenio
1996 arXiv   pre-print
Certainly, a number of planning architectures and their accompanying plan libraries have been implemented, but while the architectures themselves may be reused in a new domain, the library of plans typically  ...  One way to address this problem is to use machine learning techniques to automate the derivation of planning resources for new domains.  ...  The distribution of the grammatical forms in these examples is shown in the following table: tree takes the three function features and predicts the DONT, NEVER, and Neg-TC forms.  ... 
arXiv:cmp-lg/9607015v1 fatcat:jg7kqcuqh5dlrhzzuofdgeqdye

Grammatical Constraints on Intra-sentential Code-Switching: From Theories to Working Models [article]

Gayatri Bhat and Monojit Choudhury and Kalika Bali
2016 arXiv   pre-print
We make one of the first attempts to build working models for intra-sentential code-switching based on the Equivalence-Constraint (Poplack 1980) and Matrix-Language (Myers-Scotton 1993) theories.  ...  Taking insights from the errors made by the models, we propose a new model that combines features of both the theories.  ...  Since the Hi tree is a projection of the English tree, categorical and grammatical congruence assumptions are upheld.  ... 
arXiv:1612.04538v1 fatcat:wjdx7hzedngt7a5j4vvbmnng5a

Effects of Population, Generation and Test Case Count on Grammatical Genetic Programming for Integer Lists

Hakan Ayral, Songül Albayrak
2017 Journal of Software  
Finally, we propose an AST based dead-code removal for the intron induced non-functional codes on evolved individuals.  ...  This paper investigates how grammatical genetic programming performs for evolving simple integer list manipulation functions.  ...  expression, a complete decision tree, or the source code of a complete program.  ... 
doi:10.17706/jsw.12.6.483-492 fatcat:kbn72y42avhdteyojodizjklbi

Constructing an optimisation phase using Grammatical Evolution

B. J. Alexander, M. J. Gratton
2009 2009 IEEE Congress on Evolutionary Computation  
-We use Grammatical Evolution (GE) a form of Genetic Programming (GP). -The genotype to phenotype encoding in GE constrains the population to syntactically correct individuals.  ...  -Benchmarks needed to be carefully chosen to require multiple strategies and have a gradual gradient of difficulty. • Fitness calculated relative to cost of hand-coded DMO on each benchmark i (cost_opt  ... 
doi:10.1109/cec.2009.4983083 dblp:conf/cec/AlexanderG09 fatcat:jdqrbucd2nbnvc7me7z3bpxke4
« Previous Showing results 1 — 15 out of 24,983 results