Changeset 12290 for branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization

Timestamp:

04/07/15 14:31:06 (10 years ago)

Author:

gkronber

Message:

#2283 created a new branch to separate development from aballeit

Location:

branches/HeuristicLab.Problems.GrammaticalOptimization-gkr

Files:

• . (copied) (copied from branches/HeuristicLab.Problems.GrammaticalOptimization)
• HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Problems.GrammaticalOptimization.csproj (modified) (2 diffs)
• HeuristicLab.Problems.GrammaticalOptimization/Problems/EvenParityProblem.cs (modified) (1 diff)
• HeuristicLab.Problems.GrammaticalOptimization/Problems/FindPhrasesProblem.cs (modified) (1 diff)
• HeuristicLab.Problems.GrammaticalOptimization/Problems/RoyalPairProblem.cs (modified) (2 diffs)
• HeuristicLab.Problems.GrammaticalOptimization/Problems/RoyalPhraseSequenceProblem.cs (modified) (2 diffs)
• HeuristicLab.Problems.GrammaticalOptimization/Problems/SantaFeAntProblem.cs (modified) (1 diff)
• HeuristicLab.Problems.GrammaticalOptimization/Problems/SymbolicRegressionPoly10Problem.cs (modified) (2 diffs)

branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Problems.GrammaticalOptimization.csproj

@@ -50 +50 @@
   </ItemGroup>
   <ItemGroup>
+    <Compile Include="PartialExpressionInterpreter.cs" />
     <Compile Include="ExpressionInterpreter.cs" />
     <Compile Include="Feature.cs" />
@@ -55 +56 @@
     <Compile Include="Interfaces\IProblem.cs" />
     <Compile Include="Interfaces\ISymbolicExpressionTreeProblem.cs" />
+    <Compile Include="Problems\PrimePolynomialProblem.cs" />
     <Compile Include="Problems\PermutationProblem.cs" />
     <Compile Include="Problems\EvenParityProblem.cs" />

branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/Problems/EvenParityProblem.cs

@@ -68 +68 @@
     }
 
-    public IEnumerable<Feature> GetFeatures(string phrase) {
-      throw new NotImplementedException();
+    public IEnumerable<Feature> GetFeatures(string phrase)
+    {
+      return new[] {new Feature(phrase, 1.0)};
     }
 

branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/Problems/FindPhrasesProblem.cs

@@ -159 +159 @@
     }
 
-    public IEnumerable<Feature> GetFeatures(string phrase) {
-      throw new NotImplementedException();
+    public IEnumerable<Feature> GetFeatures(string phrase)
+    {
+      return new Feature[] {new Feature(phrase, 1.0),};
     }
 

branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/Problems/RoyalPairProblem.cs

@@ -10 +10 @@
   // counts the number of times a pair of symbols occurs in a sentence
   public class RoyalPairProblem : ISymbolicExpressionTreeProblem {
-    private const string grammarString = @"
-G(S):
-S -> a | aS | b | bS
-";
-
-    private const string hlGrammarString = @"
-G(S):
-S -> a | b | SS
-";
 
     private readonly IGrammar grammar;
+    private readonly int numTerminals;
     public string Name { get { return "RoyalPair"; } }
-    
-    public RoyalPairProblem() {
-      this.grammar = new Grammar(grammarString);
-      this.TreeBasedGPGrammar = new Grammar(hlGrammarString);
-      // TODO: allow configuration of the number of symbols
+
+    public RoyalPairProblem(int numTerminals = 2) {
+      this.numTerminals = numTerminals;
+
+      var sentenceSymbol = 'S';
+      var terminalSymbols = Enumerable.Range(0, numTerminals).Select(off => (char)((byte)'a' + off)).ToArray();
+      var nonTerminalSymbols = new char[] { sentenceSymbol };
+
+      {
+        // create grammar
+        // S -> a..z | aS .. zS
+        var rules = terminalSymbols.Select(t => Tuple.Create(sentenceSymbol, t.ToString()))
+          .Concat(terminalSymbols.Select(t => Tuple.Create(sentenceSymbol, t + sentenceSymbol.ToString())));
+
+        this.grammar = new Grammar(sentenceSymbol, terminalSymbols, nonTerminalSymbols, rules);
+      }
+      {
+        // create grammar for tree-based GP
+        // S -> a..z | SS
+        var rules = terminalSymbols.Select(t => Tuple.Create(sentenceSymbol, t.ToString()))
+          .Concat(new Tuple<char, string>[] { Tuple.Create(sentenceSymbol, sentenceSymbol.ToString() + sentenceSymbol) });
+
+        this.TreeBasedGPGrammar = new Grammar(sentenceSymbol, terminalSymbols, nonTerminalSymbols, rules);
+      }
+
+
     }
 
@@ -49 +62 @@
 
     public IEnumerable<Feature> GetFeatures(string phrase) {
-      throw new NotImplementedException();
+      if (phrase.Length <= 1)
+        yield return new Feature("$$", 1.0);
+      else if (phrase.Length == 2)
+        yield return new Feature(phrase, 1.0);
+      else if (phrase.EndsWith("S")) // second to last symbol
+        yield return new Feature(phrase.Substring(phrase.Length - 3, 2), 1.0);
+      else // last symbol
+        yield return new Feature(phrase.Substring(phrase.Length - 2, 2), 1.0);
+
     }
+
     public IGrammar TreeBasedGPGrammar { get; private set; }
     public string ConvertTreeToSentence(ISymbolicExpressionTree tree) {

branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/Problems/RoyalPhraseSequenceProblem.cs

@@ -3 +3 @@
 using System.Diagnostics;
 using System.Linq;
+using System.Runtime.InteropServices;
 using System.Text;
 using System.Text.RegularExpressions;
@@ -148 +149 @@
     }
 
-    public IEnumerable<Feature> GetFeatures(string phrase) {
-      throw new NotImplementedException();
+    public IEnumerable<Feature> GetFeatures(string phrase)
+    {
+      return new Feature[] {new Feature(phrase, 1.0)};
     }
 

branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/Problems/SantaFeAntProblem.cs

@@ -138 +138 @@
 
     public IEnumerable<Feature> GetFeatures(string phrase) {
-      phrase = CanonicalRepresentation(phrase);
-      var isTerminal = grammar.IsTerminal(phrase);
-
-      yield return new Feature(isTerminal + ToString(), 1.0);
-     
-      yield return new Feature("$" + (phrase.Length > 0 ? phrase[0] : ' '), 1.0);
-      if (!isTerminal) {
-        for (int i = 4; i < phrase.Length; i++) {
-          if (!grammar.IsTerminal(phrase[i])) {
-            yield return new Feature(phrase[i - 4].ToString() + phrase[i - 3].ToString() + phrase[i - 2] + phrase[i - 1], 1.0);
-            break;
-          }
-        }
-      }
-    
       yield return new Feature(phrase, 1.0);
+      //var ant = new Ant(false);
+      //int p = 0;
+      //Run(ant, phrase.Replace('A', '.'), ref p, true);
+      //yield return new Feature(ant.PosX + "x" + ant.PosY + "-" + ant.Heading, 1.0);
     }
 

branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/Problems/SymbolicRegressionPoly10Problem.cs

@@ -19 +19 @@
     //    V -> a .. j 
     //    ";
+    //private const string grammarString = @"
+    //G(E):
+    //E -> a | b | c | d | e | f | g | h | i | j | a+E | b+E | c+E | d+E | e+E | f+E | g+E | h+E | i+E | j+E | a*E | b*E | c*E | d*E | e*E | f*E | g*E | h*E | i*E | j*E 
+    //";
     private const string grammarString = @"
     G(E):
-    E -> a | b | c | d | e | f | g | h | i | j | a+E | b+E | c+E | d+E | e+E | f+E | g+E | h+E | i+E | j+E | a*E | b*E | c*E | d*E | e*E | f*E | g*E | h*E | i*E | j*E 
+    E -> a | b | c | d | e | f | g | h | i | j | a+E | b+E | c+E | d+E | e+E | f+E | g+E | h+E | i+E | j+E | a*E | b*E | c*E | d*E | e*E | f*E | g*E | h*E | i*E | j*E  
     ";
 
@@ -148 +152 @@
     }
 
+    private double[] varIds = new double[] { };
+
     // splits the phrase into terms and creates (sparse) term-occurrance features
     public IEnumerable<Feature> GetFeatures(string phrase) {
-      var canonicalTerms = new HashSet<string>();
-      foreach (string t in phrase.Split('+')) {
-        canonicalTerms.Add(CanonicalTerm(t));
-      }
-      return canonicalTerms.Select(entry => new Feature(entry, 1.0))
-        .Concat(new Feature[] { new Feature(CanonicalRepresentation(phrase), 1.0) });
+      // var canonicalTerms = new HashSet<string>();
+      // foreach (string t in phrase.Split('+')) {
+      //   canonicalTerms.Add(CanonicalTerm(t));
+      // }
+      // return canonicalTerms.Select(entry => new Feature(entry, 1.0))
+      //   .Concat(new Feature[] { new Feature(CanonicalRepresentation(phrase), 1.0) });
+
+      var partialInterpreter = new PartialExpressionInterpreter();
+      var vars = new double[] { 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, };
+      var s = partialInterpreter.Interpret(phrase, vars);
+      //if (s.Any())
+      //  return new Feature[] { new Feature(s.Pop().ToString(), 1.0), };
+      //else
+      //  return new Feature[] { new Feature("$", 1.0), };
+      return new Feature[] { new Feature(string.Join(",", s), 1.0) };
     }