Package fig.basic

Examples of fig.basic.LispTree.child()

234
235
236
237
238
239
240
241
242
243
244
    if (tree.isLeaf()) {
      String fbProperty = FreebaseInfo.isReverseProperty(tree.value) ? tree.value.substring(1) : tree.value;
      return freebaseInfo.fbPropertyHasOpposite(fbProperty);
    } else {
      // Un-reverse everything.
      String binary1 = tree.child(2).child(0).value;
      binary1 = FreebaseInfo.isReverseProperty(binary1) ? binary1.substring(1) : binary1;
      String binary2 = tree.child(2).child(1).child(0).value;
      binary2 = FreebaseInfo.isReverseProperty(binary2) ? binary2.substring(1) : binary2;
      return freebaseInfo.fbPropertyHasOpposite(binary1) && freebaseInfo.fbPropertyHasOpposite(binary2);
    }
View Full Code Here
236
237
238
239
240
241
242
243
244
245
246
      return freebaseInfo.fbPropertyHasOpposite(fbProperty);
    } else {
      // Un-reverse everything.
      String binary1 = tree.child(2).child(0).value;
      binary1 = FreebaseInfo.isReverseProperty(binary1) ? binary1.substring(1) : binary1;
      String binary2 = tree.child(2).child(1).child(0).value;
      binary2 = FreebaseInfo.isReverseProperty(binary2) ? binary2.substring(1) : binary2;
      return freebaseInfo.fbPropertyHasOpposite(binary1) && freebaseInfo.fbPropertyHasOpposite(binary2);
    }
  }
View Full Code Here
250
251
252
253
254
255
256
257
258
259
260
    if (tree.isLeaf()) {
      String fbProperty = FreebaseInfo.isReverseProperty(tree.value) ? tree.value.substring(1) : tree.value;
      return freebaseInfo.fbPropertyHasOpposite(fbProperty);
    } else {
      // Un-reverse everything.
      String binary1 = tree.child(2).child(0).value;
      binary1 = FreebaseInfo.isReverseProperty(binary1) ? binary1.substring(1) : binary1;
      String binary2 = tree.child(2).child(1).child(0).value;
      binary2 = FreebaseInfo.isReverseProperty(binary2) ? binary2.substring(1) : binary2;
      return freebaseInfo.fbPropertyHasOpposite(binary1) && freebaseInfo.fbPropertyHasOpposite(binary2);
    }
View Full Code Here
252
253
254
255
256
257
258
259
260
261
262
      return freebaseInfo.fbPropertyHasOpposite(fbProperty);
    } else {
      // Un-reverse everything.
      String binary1 = tree.child(2).child(0).value;
      binary1 = FreebaseInfo.isReverseProperty(binary1) ? binary1.substring(1) : binary1;
      String binary2 = tree.child(2).child(1).child(0).value;
      binary2 = FreebaseInfo.isReverseProperty(binary2) ? binary2.substring(1) : binary2;
      return freebaseInfo.fbPropertyHasOpposite(binary1) && freebaseInfo.fbPropertyHasOpposite(binary2);
    }
  }
View Full Code Here
264
265
266
267
268
269
270
271
272
273
274
  public boolean isReversed(Formula formula) {
    LispTree tree = formula.toLispTree();
    if (tree.isLeaf())
      return FreebaseInfo.isReverseProperty(tree.value);
    else
      return FreebaseInfo.isReverseProperty(tree.child(2).child(0).value);
  }

  /** assumes we checked there is an opposite formula */
  public Formula equivalentFormula(String formula) {
    LispTree tree = LispTree.proto.parseFromString(formula);
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
      for(int i = 1; i < exp.children.size();++i) {

        LispTree child = exp.child(i);
        int currState = numOfStates-1;
        LanguageExpToken langExpToken = new LanguageExpToken(child.child(0).value, child.child(1).value);

        if(langExpToken.repeat==RepeatType.PLUS) {
          addEdge(currState, currState+1,langExpToken);
          addEdge(currState+1, currState+1,langExpToken);
        }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
      for(int i = 1; i < exp.children.size();++i) {

        LispTree child = exp.child(i);
        int currState = numOfStates-1;
        LanguageExpToken langExpToken = new LanguageExpToken(child.child(0).value, child.child(1).value);

        if(langExpToken.repeat==RepeatType.PLUS) {
          addEdge(currState, currState+1,langExpToken);
          addEdge(currState+1, currState+1,langExpToken);
        }
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
  public SyntacticRule(String lispTree) {
    LispTree tree = LispTree.proto.parseFromString(lispTree);
    if(tree.children.size()!=3)
      throw new RuntimeException("Number of children in a rule must be three");
    lhs = new LanguageExp(tree.child(1));
    LispTree rhsTree = tree.child(2);

    //now go over the tree
    for(int i = 1; i < rhsTree.children.size();++i)
      rhs.add(addRhsObject(rhsTree.child(i).value));
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
    lhs = new LanguageExp(tree.child(1));
    LispTree rhsTree = tree.child(2);

    //now go over the tree
    for(int i = 1; i < rhsTree.children.size();++i)
      rhs.add(addRhsObject(rhsTree.child(i).value));
  }

  private Object addRhsObject(String value) {
    try {
      return Integer.parseInt(value);
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
  public static Example fromLispTree(LispTree tree, String defaultId) {
    Builder b = new Builder().setId(defaultId);

    for (int i = 1; i < tree.children.size(); i++) {
      LispTree arg = tree.child(i);
      String label = arg.child(0).value;
      if ("id".equals(label)) {
        b.setId(arg.child(1).value);
      } else if ("utterance".equals(label)) {
        b.setUtterance(arg.child(1).value);
      } else if ("targetFormula".equals(label)) {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.