Examples of DependencyTree

Examples of org.fnlp.nlp.parser.dep.DependencyTree

78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
    return t;
  }

  private static void to2HeadsArray(DependencyTree dt, Target t) {
    for(int i = 0; i < dt.leftChilds.size(); i++)  {
      DependencyTree ch = dt.leftChilds.get(i);
      t.setHeads(ch.id, dt.id);
      t.setDepClass(ch.id, ch.getDepClass());
      to2HeadsArray(ch,t);
    }
    t.words[dt.id] = dt.word;
    t.pos[dt.id] = dt.pos;
    for(int i = 0; i < dt.rightChilds.size(); i++)  {
      DependencyTree ch = dt.rightChilds.get(i);
      t.setHeads(ch.id,dt.id);
      t.setDepClass(ch.id,ch.getDepClass());
      to2HeadsArray(ch,t);
    }
  }
View Full Code Here

Examples of org.fnlp.nlp.parser.dep.DependencyTree

180
181
182
183
184
185
186
187
188
189
190
191
192
      return false;
  }

  public DependencyTree toTree() {
    ArrayList<DependencyTree> nodes = new ArrayList<DependencyTree>();
    DependencyTree root = null;
    for(int j=0;j<words.length;j++){
      DependencyTree node = new DependencyTree(j, words[j],tags[j], relations[j]);
      nodes.add(node);
    }
    for(int j=0;j<words.length;j++){
      int head = heads[j];
      if(head==-1)
View Full Code Here

Examples of org.fnlp.nlp.parser.dep.DependencyTree

146
147
148
149
150
151
152
153
154
155
156
157
158
      return false;
  }

  public DependencyTree toTree() {
    ArrayList<DependencyTree> nodes = new ArrayList<DependencyTree>();
    DependencyTree root = null;
    for(int j=0;j<words.length;j++){
      DependencyTree node = new DependencyTree(j, owords[j],otags[j], relations[j]);
      nodes.add(node);
    }
    for(int j=0;j<words.length;j++){
      int head = heads[j];
      if(head==-1)
View Full Code Here

Examples of org.sonar.wsclient.services.DependencyTree

27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
public class DependencyTreeUnmarshaller extends AbstractUnmarshaller<DependencyTree> {
  @Override
  protected DependencyTree parse(Object json) {
    WSUtils utils = WSUtils.getINSTANCE();
    DependencyTree tree = new DependencyTree()
        .setDepId(utils.getString(json, "did"))
        .setResourceId(utils.getString(json, "rid"))
        .setResourceKey(utils.getString(json, "k"))
        .setResourceName(utils.getString(json, "n"))
        .setResourceScope(utils.getString(json, "s"))
        .setResourceQualifier(utils.getString(json, "q"))
        .setResourceVersion(utils.getString(json, "v"))
        .setUsage(utils.getString(json, "u"))
        .setWeight(utils.getInteger(json, "w"));

    List<DependencyTree> to = new ArrayList<DependencyTree>();
    tree.setTo(to);

    Object toJson = utils.getField(json, "to");
    if (toJson != null) {
      for (int i = 0; i < utils.getArraySize(toJson); i++) {
        to.add(parse(utils.getArrayElement(toJson, i)));
View Full Code Here

Examples of seekfeel.utilities.stanfordwrapper.DependencyTree

113
114
115
116
117
118
119
120
121
122
123
        nouns.addAll(resultData.getPronouns());
        double totalScore = 0;

        ArrayList<Integer> visistedWords = new ArrayList<Integer>();
        for (WordPos noun : nouns) {
            DependencyTree currentTree = resultData.getDependencyTree(noun, visistedWords, null);
            totalScore += computeTreeWeight(currentTree, allWords);
        }

        return evaluateSentiment(totalScore);
    }
View Full Code Here

Examples of seekfeel.utilities.stanfordwrapper.DependencyTree

124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
    public double computeTreeWeight(DependencyTree root, ArrayList<Word> originalWords) {
        double totalWeight = 0;
        int signMultiplier;
        Stack<DependencyTree> s = new Stack<DependencyTree>();
        DependencyTree iterator;
        for (int i = 0; i < root.getChilds().size(); i++) {
            s.push(root.getChild(i));
        }
        while (!s.empty()) {
            iterator = s.pop();
            signMultiplier = iterator.isNegated() ? -1 : 1;
            totalWeight += (signMultiplier * aggregator.getWordScore(iterator.getWord(), originalWords));
            for (int i = 0; i < iterator.getChilds().size(); i++) {
                s.push(iterator.getChild(i));
            }
        }
        return totalWeight;
    }
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.