Changeset 12893 for branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/Problems/SantaFeAntProblem.cs

Timestamp:

08/24/15 13:56:27 (9 years ago)

Author:

gkronber

Message:

#2283: experiments on grammatical optimization algorithms (maxreward instead of avg reward, ...)

File:

• branches/HeuristicLab.Problems.GrammaticalOptimization-gkr/HeuristicLab.Problems.GrammaticalOptimization/Problems/SantaFeAntProblem.cs (modified) (3 diffs)

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

@@ -30 +30 @@
     // here we use a modified grammar which has only one syntax tree for each sentence
 
+    public IEnumerable<string> OptimalSentences {
+      get {
+        return new string[]
+        {
+          "?(m)(ll?(m)(r))mr",
+          "?(m)(rr?(m)(l))ml",
+          "r?(m)(ll?(m)(r))m",
+          "l?(m)(rr?(m)(l))m",
+          "mr?(m)(ll?(m)(r))",
+          "ml?(m)(rr?(m)(l))",
+          "?(m)(ll?(m)(l))ml",
+          "?(m)(rr?(m)(r))mr",
+          "l?(m)(ll?(m)(l))m",
+          "r?(m)(rr?(m)(r))m",
+          "ml?(m)(ll?(m)(l))",
+          "mr?(m)(rr?(m)(r))",
+        };
+      }
+    }
 
     private readonly IGrammar grammar;
@@ -138 +157 @@
 
     public IEnumerable<Feature> GetFeatures(string phrase) {
-      yield return new Feature(phrase, 1.0);
+      for (int idx = 0; idx < 15; idx++) {
+        foreach (var t in Grammar.TerminalSymbols)
+          yield return new Feature(t.ToString(), phrase.Length > idx ? phrase[idx] == t ? 1 : 0 : 0);
+      }
       //var ant = new Ant(false);
       //int p = 0;
@@ -166 +188 @@
       }
     }
+    public bool IsOptimalPhrase(string phrase) {
+      var firstNonTerminalIdx = new Sequence(phrase).FirstNonTerminalIndex;
+      if (firstNonTerminalIdx == -1) firstNonTerminalIdx = phrase.Length;
+      return OptimalSentences.Any(s => s.Substring(0, firstNonTerminalIdx) == phrase.Substring(0, firstNonTerminalIdx));
+    }
+
   }