Package fig.basic

Examples of fig.basic.LispTree

24
25
26
27
28
29
30
31
32
33
34
35
    this.func = func;
    this.args = args;
  }

  public LispTree toLispTree() {
    LispTree tree = LispTree.proto.newList();
    tree.addChild("call");
    tree.addChild(func.toLispTree());
    for (Formula arg : args)
      tree.addChild(arg.toLispTree());
    return tree;
  }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
    newFv.add(featureVector);
    return new FeatureSimilarity(newFv, source, target, score);
  }

  public LispTree toLispTree() {
    LispTree tree = LispTree.proto.newList();
    tree.addChild("similarity");
    tree.addChild(LispTree.proto.newList("source", source));
    tree.addChild(LispTree.proto.newList("target", target));
    tree.addChild(LispTree.proto.newList("sim_score", ""+score));
    return tree;
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
    this.var = var;
    this.body = body;
  }

  public LispTree toLispTree() {
    LispTree tree = LispTree.proto.newList();
    tree.addChild("mark");
    tree.addChild(var);
    tree.addChild(body.toLispTree());
    return tree;
  }
View Full Code Here
35
36
37
38
39
40
41
42
43
44
  public ErrorValue(LispTree tree) { this.type = tree.child(1).value; }
  public ErrorValue(String type) { this.type = type; }

  public LispTree toLispTree() {
    LispTree tree = LispTree.proto.newList();
    tree.addChild("error");
    tree.addChild(type != null ? type : "");
    return tree;
  }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
    this.month = Integer.valueOf(tree.child(2).value);
    this.day = Integer.valueOf(tree.child(3).value);
  }

  public LispTree toLispTree() {
    LispTree tree = LispTree.proto.newList();
    tree.addChild("date");
    tree.addChild(String.valueOf(year));
    tree.addChild(String.valueOf(month));
    tree.addChild(String.valueOf(day));
    return tree;
  }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
  public static final Map<String,Counter<String>> verbSemclassMap = VerbSemClassExtractor.getWordToWordCounterMap();

  public DeletionRule(String expression) {
    super(expression);
    LispTree tree = LispTree.proto.parseFromString(expression);
    LispTree rhsTree = tree.child(2);
    if(rhsTree.children.size()!=3)
      throw new RuntimeException("In a deletion rules there must be exactly three items on the rhs");
  }
View Full Code Here
208
209
210
211
212
213
214
215
216
217
class SubstitutionRule extends SyntacticRule {

  public SubstitutionRule(String expression) {
    super(expression);
    LispTree tree = LispTree.proto.parseFromString(expression);
    LispTree rhsTree = tree.child(2);
    if(rhsTree.children.size()!=3)
      throw new RuntimeException("In a substitution rules there must be exactly three items on the rhs");
  }
View Full Code Here
468
469
470
471
472
473
474
475
476
477
478
479
480
    public String toString() {
      return toLispTree().toString();
    }
    public LispTree toLispTree() {
      LispTree tree = LispTree.proto.newList();
      tree.addChild("wordinfo");
      tree.addChild(token);
      tree.addChild(lemma);
      tree.addChild(pos);
      tree.addChild(nerTag);
      return tree;
    }
View Full Code Here
304
305
306
307
308
309
310
311
312
313
class MoveRule extends SyntacticRule {

  public MoveRule(String expression) {
    super(expression);
    LispTree tree = LispTree.proto.parseFromString(expression);
    LispTree rhsTree = tree.child(2);
    if(rhsTree.children.size()!=3)
      throw new RuntimeException("In a substitution rules there must be exactly three items on the rhs");
  }
View Full Code Here
363
364
365
366
367
368
369
370
371
372
373
374
 
  PhraseTable phraseTable;

  public PhraseTableRule(String expression) {
    super(expression);
    LispTree tree = LispTree.proto.parseFromString(expression);
    LispTree rhsTree = tree.child(2);
    if(rhsTree.children.size()!=3)
      throw new RuntimeException("In a phrasetable rule there must be exactly three items on the rhs");
   
    if(phraseTable==null)
      phraseTable = PhraseTable.getSingleton();
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.