Grammatical Evolution (GE) is a grammar based GA to generate computer programs which has been shown to be comparable with GP when applied to a diverse array of problems. GE has the distinction that its input is a BNF, which permits it to generate programs in any language, of arbitrary complexity, including loops, multiple line functions etc. Part of the power of GE is that it is closer to natur...

The traditional models of price, and its statistical signatures are often based on limiting assumptions, such as linearity. Moreover, the model developer is faced with the model selection problem, and model uncertainty. In this paper we introduce a method based on Grammatical Evolution (GE) to evolve models for predicting financial returns, and we examine the profitability of these models. Our ...

We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern the mapping of a Backus Naur Form grammar definition to a program, expressions and programs of arbitrary complexity may be evolved. Our system, Grammatical Evolution, has been applied to problems such as a Symbolic Regression problem, and finding Trigonometric Identities. In this p...

A novel method for feature selection and construction is introduced. The method improves the classification accuracy, utilizing the well-established technique of grammatical evolution by creating non-linear mappings of the original features to artificial ones in order to improve the effectiveness of artificial intelligence tools such as multi-layer perceptron (MLP), Radial-basis-function (RBF) ...

Abstract Fuzzy pattern trees evolved using grammatical evolution, a system we call Grammatical Evolution, are shown to be robust Explainable Artificial Intelligence technique. Experimental results show Evolution achieves competitive when compared against SVM, Random Forest and Logistic Regression on set of real world benchmark problems. allows for human input throughout the evolutionary process...

Phonetic transcription is a core procedure of continuous speech recognition systems and speech synthesizers. The more correct phonetic translation is the more successful applications using phonetic transcription are. Phonological rules translate text to graphemes. These rules significantly reduce size of databases with words and it’s phonetic transcription and speeds up transcription process. T...