paper-with-me

Papers

Context Matters: Adaptive Mutation for Grammars

2023-03-25 · Pedro Carvalho, Jessica Mégane, Nuno Lourenço, Penousal Machado

This work proposes Adaptive Facilitated Mutation, a self-adaptive mutation method for Structured Grammatical Evolution (SGE), biologically inspired by the theory of facilitated variation. In SGE, the genotype of individuals contains a list for each non-terminal of the grammar that defines the search space. In our proposed mutation, each individual contains an array with a different, self-adaptive mutation rate for each non-terminal. We also propose Function Grouped Grammars, a grammar design procedure, to enhance the benefits of the proposed mutation. Experiments were conducted on three symbolic regression benchmarks using Probabilistic Structured Grammatical Evolution (PSGE), a variant of SGE. Results show our approach is similar or better when compared with the standard grammar and mutation.

📄 PDF Abstract BibTeX arXiv:2303.14522

Code (1)

jessicamegane/psge 공식 구현

Tasks

Symbolic Regression

Similar Papers 제목 키워드 기반

Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies

2013-11-25 · Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi 외

Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space an…

Translation

A CCG-Based Version of the DisCoCat Framework

2021-05-17 · ACL (SemSpace, IWCS) 2021 6 · Richie Yeung, Dimitri Kartsaklis

While the DisCoCat model (Coecke et al., 2010) has been proved a valuable tool for studying compositional aspects of language at the level of semantics, its strong dependency on pregroup grammars poses important restrict…

A generalized parsing framework for Abstract Grammars

2017-10-31 · Daniel Harasim, Chris Bruno, Eva Portelance, Martin Rohrmeier 외

This technical report presents a general framework for parsing a variety of grammar formalisms. We develop a grammar formalism, called an Abstract Grammar, which is general enough to represent grammars at many levels of …

Multiple Context-Free Tree Grammars: Lexicalization and Characterization

2017-07-11 · Joost Engelfriet, Andreas Maletti, Sebastian Maneth

Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transf…

Regular transductions with MCFG input syntax

2019-09-01 · WS 2019 9 · Mark-Jan Nederhof, Heiko Vogler

We show that regular transductions for which the input part is generated by some multiple context-free grammar can be simulated by synchronous multiple context-free grammars. We prove that synchronous multiple context-fr…