Package fig.basic

Examples of fig.basic.LispTree

36
37
38
39
40
41
42
43
44
45
    if("*".equals(repeat)) return RepeatType.STAR;
    throw new RuntimeException("Illegal repeat type: " + repeat);
  }

  public LispTree toLispTree() {
    LispTree tree = LispTree.proto.newList();
    tree.addChild(type.toString());
    tree.addChild(valuePattern.toString());
    return tree;
  }
View Full Code Here
26
27
28
29
30
31
32
33
34
35
    this.relation = relation;
    this.child = child;
  }

  public LispTree toLispTree() {
    LispTree tree = LispTree.proto.newList();
    tree.addChild(relation.toLispTree());
    tree.addChild(child.toLispTree());
    return tree;
  }
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
            id.substring(1) : "!" + id));
  }

  /** supports chains only */
  public boolean hasOpposite(String formula) {
    LispTree tree = LispTree.proto.parseFromString(formula);
    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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
    }
  }

  /** supports chains only */
  public boolean hasOpposite(Formula formula) {
    LispTree tree = formula.toLispTree();
    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
260
261
262
263
264
265
266
267
268
269
270
    }
  }

  /** supports chains only */
  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);
  }
View Full Code Here
269
270
271
272
273
274
275
276
      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);
    return equivalentFormula(tree);
  }
View Full Code Here
274
275
276
277
278
279
280
281
    LispTree tree = LispTree.proto.parseFromString(formula);
    return equivalentFormula(tree);
  }

  public Formula equivalentFormula(Formula formula) {
    LispTree tree = formula.toLispTree();
    return equivalentFormula(tree);
  }
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
    private void compileExpression(LispTree exp) {

      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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
 
  protected LanguageExp lhs;
  protected List<Object> rhs=new ArrayList<Object>();; //list of either lhs items or wordinfos for generating the consquent

  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
199
200
201
202
203
204
205
206
207
208
209
          String line = edu.stanford.nlp.sempre.vis.Utils.readLineHard(in);
          if (line == null) {
            closeFiles();
            return null;
          }
          LispTree tree = LispTree.proto.parseFromString(line);
          // Deprecation warnings come through here.
          Example ex = Example.fromLispTree(tree);
          row.add(ex);
        }
        return row;
View Full Code Here
TOP

Related Classes of fig.basic.LispTree

  • edu.stanford.nlp.sempre.AggregateFormula
  • edu.stanford.nlp.sempre.BooleanValue
  • edu.stanford.nlp.sempre.BridgeFn
  • edu.stanford.nlp.sempre.CallFormula
  • edu.stanford.nlp.sempre.DateValue
  • edu.stanford.nlp.sempre.DescriptionValue
  • edu.stanford.nlp.sempre.ErrorValue
  • edu.stanford.nlp.sempre.Evaluation
  • edu.stanford.nlp.sempre.Example
  • edu.stanford.nlp.sempre.fbalignment.lexicons.LexicalEntry$LexicalEntrySerializer
    • Copyright © 2018 www.massapicom. 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.