Package org.apache.ctakes.dependency.parser.util

Examples of org.apache.ctakes.dependency.parser.util.DependencyPath

166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
     
      if ( isDonorTerm(tok) ) {
        vfeat.put(DONOR_TOKEN, true);
       
        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(DONOR_DEPTOK, true);
        }
      }
      if ( isFamilyTerm(tok) ) {
        vfeat.put(FAMILY_TOKEN, true);

        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
       
        // 6/28/13 srh fixing for null pointer exception
        if (path != null) {
          int commonInd = path.indexOf(path.getCommonNode());
          if (commonInd==1 || commonInd==path.size()-2) {
            vfeat.put(FAMILY_DEPTOK, true);
          }
        }
      }
     
      if ( isOtherTerm(tok) ) {
        vfeat.put(OTHER_TOKEN, true);

        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(OTHER_DEPTOK, true);
        }
      }
    }
    return vfeat;
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
   
    // Iterate through all nodes in the sentence to find the focus node
    for (int i=0; i<nodes.size(); i++) {
      ConllDependencyNode hypNegNode = nodes.get(i);
//      System.out.println("Node "+i+": {"+hypNegNode.getFORM()+"}"+hypNegNode.getPOSTAG()+">"+hypNegNode.getDEPREL());
      DependencyPath path = DependencyUtility.getPath(nodes, hypNegNode, focus);
      if(path == null) continue;
      int featMatchInd = findPathMatches(path);
      if ( featMatchInd != -1) {
//        hits.add(hypNegNode);
        feats[featMatchInd] = true;
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
     
      if ( isDonorTerm(tok) ) {
        vfeat.put(DONOR_TOKEN, true);
       
        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(DONOR_DEPTOK, true);
        }
      }
      if ( isFamilyTerm(tok) ) {
        vfeat.put(FAMILY_TOKEN, true);

        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
       
        // 6/28/13 srh fixing for null pointer exception
        if (path != null) {
          int commonInd = path.indexOf(path.getCommonNode());
          if (commonInd==1 || commonInd==path.size()-2) {
            vfeat.put(FAMILY_DEPTOK, true);
          }
        }
      }
     
      if ( isOtherTerm(tok) ) {
        vfeat.put(OTHER_TOKEN, true);

        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(OTHER_DEPTOK, true);
        }
      }
    }
    return vfeat;
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
   
    // Iterate through all nodes in the sentence to find the focus node
    for (int i=0; i<nodes.size(); i++) {
      ConllDependencyNode hypNegNode = nodes.get(i);
//      System.out.println("Node "+i+": {"+hypNegNode.getFORM()+"}"+hypNegNode.getPOSTAG()+">"+hypNegNode.getDEPREL());
      DependencyPath path = DependencyUtility.getPath(nodes, hypNegNode, focus);
      if(path == null) continue;
      int featMatchInd = findPathMatches(path);
      if ( featMatchInd != -1) {
//        hits.add(hypNegNode);
        feats[featMatchInd] = true;
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
     
      if ( isDonorTerm(tok) ) {
        vfeat.put(DONOR_TOKEN, true);
       
        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(DONOR_DEPTOK, true);
        }
      }
      if ( isFamilyTerm(tok) ) {
        vfeat.put(FAMILY_TOKEN, true);

        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
       
        // 6/28/13 srh fixing for null pointer exception
        if (path != null) {
          int commonInd = path.indexOf(path.getCommonNode());
          if (commonInd==1 || commonInd==path.size()-2) {
            vfeat.put(FAMILY_DEPTOK, true);
          }
        }
      }
     
      if ( isOtherTerm(tok) ) {
        vfeat.put(OTHER_TOKEN, true);

        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(OTHER_DEPTOK, true);
        }
      }
    }
    return vfeat;
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
     
      if ( isDonorTerm(tok) ) {
        vfeat.put(DONOR_TOKEN, true);
       
        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(DONOR_DEPTOK, true);
        }
      }
      if ( isFamilyTerm(tok) ) {
        vfeat.put(FAMILY_TOKEN, true);

        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(FAMILY_DEPTOK, true);
        }
      }
     
      if ( isOtherTerm(tok) ) {
        vfeat.put(OTHER_TOKEN, true);

        // check if there are one-removed dependencies on the dependency path
        DependencyPath path = DependencyUtility.getPath(jCas, DependencyUtility.getNominalHeadNode(jCas,tok),
            DependencyUtility.getNominalHeadNode(jCas,mention));
        int commonInd = path.indexOf(path.getCommonNode());
        if (commonInd==1 || commonInd==path.size()-2) {
          vfeat.put(OTHER_DEPTOK, true);
        }
      }
    }
View Full Code Here
TOP

Related Classes of org.apache.ctakes.dependency.parser.util.DependencyPath

  • org.apache.ctakes.assertion.attributes.subject.SubjectAttributeClassifier
  • org.apache.ctakes.assertion.util.NegationManualDepContextAnalyzer
  • org.apache.ctakes.typesystem.type.syntax.ConllDependencyNode
    • 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.