Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.Problems.GrammaticalOptimization/HeuristicLab.Problems.GrammaticalOptimization/Problems/RoyalPairProblem.cs @ 11857

Last change on this file since 11857 was 11857, checked in by gkronber, 9 years ago

#2283: solution reorg

File size: 2.0 KB
Line 
1using System;
2using System.Collections.Generic;
3using System.Diagnostics;
4using System.Linq;
5using System.Text;
6using System.Text.RegularExpressions;
7using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
8
9namespace HeuristicLab.Problems.GrammaticalOptimization {
10  // counts the number of times a pair of symbols occurs in a sentence
11  public class RoyalPairProblem : ISymbolicExpressionTreeProblem {
12    private const string grammarString = @"
13G(S):
14S -> a | aS | b | bS
15";
16
17    private const string hlGrammarString = @"
18G(S):
19S -> a | b | SS
20";
21
22    private readonly IGrammar grammar;
23    public RoyalPairProblem() {
24      this.grammar = new Grammar(grammarString);
25      this.TreeBasedGPGrammar = new Grammar(hlGrammarString);
26      // TODO: allow configuration of the number of symbols
27    }
28
29    public double BestKnownQuality(int maxLen) {
30      return maxLen - 1;
31    }
32
33    public IGrammar Grammar {
34      get { return grammar; }
35    }
36
37    private Regex regex = new Regex("(?=ab)|(?=ba)"); // count the number of "ab" and "ba" pairs
38    public double Evaluate(string sentence) {
39      // sentence must contain only terminal symbols, we are not checking if the sentence is syntactically valid here because it would be too slow!
40      Debug.Assert(sentence.Any(c => grammar.IsTerminal(c)));
41      return regex.Matches(sentence).Count;
42    }
43
44    public string CanonicalRepresentation(string phrase) {
45      return phrase;
46    }
47
48    public IEnumerable<Feature> GetFeatures(string phrase) {
49      throw new NotImplementedException();
50    }
51    public IGrammar TreeBasedGPGrammar { get; private set; }
52    public string ConvertTreeToSentence(ISymbolicExpressionTree tree) {
53      var sb = new StringBuilder();
54      foreach (var s in tree.Root.GetSubtree(0).GetSubtree(0).IterateNodesPrefix()) {
55        if (s.Symbol.Name == "S") continue;
56        sb.Append(s.Symbol.Name);
57      }
58      return sb.ToString();
59    }
60  }
61}
Note: See TracBrowser for help on using the repository browser.