예제 #1
0
  /**
   * @param word
   * @param listFeatIndsOfCurInp
   * @param listFeatCountOfCurInp
   */
  private void addTriggerWordFeatures(
      String word,
      ArrayList<Integer> listFeatIndsOfCurInp,
      ArrayList<Integer> listFeatCountOfCurInp) {

    int tgCharIndex = Triggers.listOf1stChar.indexOf(word.charAt(0));

    if (tgCharIndex >= 0) {
      int tgWordIndex = Triggers.listOfTriggers.get(tgCharIndex).indexOf(word);

      if (tgWordIndex >= 0) {
        // add a feature indicating that what trigger word it is
        String[] feature =
            new String[] {
              "Trigger-" + Triggers.listOfTriggerLemmas.get(tgCharIndex).get(tgWordIndex) + "@",
            };

        GenericFeatVect.addNewFeatureInList(
            feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
        // *
        // add a feature indicating that there is a trigger word
        feature =
            new String[] {
              "HasTriggerWord@",
            };

        GenericFeatVect.addNewFeatureInList(
            feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
        //				*/
      }
    }
  }
예제 #2
0
  /**
   * @param dt
   * @param eBoundaries
   * @param listFeatIndsOfCurInp
   * @param listFeatCountOfCurInp
   * @throws IOException
   */
  private void createNgramFeatures(
      DependencyTree dt,
      int weight,
      Entity ent,
      ArrayList<Integer> listFeatIndsOfCurInp,
      ArrayList<Integer> listFeatCountOfCurInp)
      throws IOException {

    String[] feature = new String[0];

    // collecting the unigram within a window of {-x, +x}

    int x = ent.getStartWordIndex();
    for (int i = x - 1; i >= x - 2 && i >= 0; i--) {
      feature = new String[] {dt.allNodesByWordIndex[i].lemma + "$" + (i - x)};

      GenericFeatVect.addNewFeatureInList(
          feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, weight);
    }

    x = ent.getEndWordIndex();
    for (int i = x + 1; i <= x + 2 && i < dt.allNodesByWordIndex.length; i++) {
      feature = new String[] {dt.allNodesByWordIndex[i].lemma + "$" + (x - i)};

      GenericFeatVect.addNewFeatureInList(
          feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, weight);
    }
  }
예제 #3
0
  /**
   * @param listOfDepRelsInReducedGraph
   * @param listFeatIndsOfCurInp
   * @param listFeatCountOfCurInp
   */
  private void extractDepPatternFeatures(
      ArrayList<String> listOfDepRelsInReducedGraph,
      ArrayList<Integer> listFeatIndsOfCurInp,
      ArrayList<Integer> listFeatCountOfCurInp) {

    ArrayList<Integer> listOfMatchedPatternIndexes = new ArrayList<Integer>();

    for (int i = 0; i < PatternsDepRelFromGraph.listOfAllPatterns.size(); i++) {

      if (DataStrucUtility.hasListOneAllElementsOfListTwo(
          listOfDepRelsInReducedGraph, PatternsDepRelFromGraph.listOfAllPatterns.get(i)))
        listOfMatchedPatternIndexes.add(i);
    }

    for (int i = 0; i < listOfMatchedPatternIndexes.size(); i++) {
      // add a feature indicating that what dep pattern it is
      String[] feature =
          new String[] {
            "DepPattern-" + listOfMatchedPatternIndexes.get(i) + "@",
          };

      GenericFeatVect.addNewFeatureInList(
          feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
    }
  }
예제 #4
0
  /**
   * @param sen
   * @param ent1
   * @param ent2
   * @param listFeatIndsOfCurInp
   * @param listFeatCountOfCurInp
   */
  public void matchPPIpatternOnSentence(
      String sen,
      String ent1,
      String ent2,
      ArrayList<Integer> listFeatIndsOfCurInp,
      ArrayList<Integer> listFeatCountOfCurInp) {

    String ENT_name_1 = "", ENT_name = "";

    ENT_name = ent2;
    ENT_name_1 = ent1;

    String[] patterns =
        new String[] {
          ENT_name_1 + "\\s*.*\\s*" + ENT_name + " complex",
          ENT_name_1 + "\\s*.*\\s*activate[sd]?\\s*.*\\s*" + ENT_name,
          ENT_name_1 + "\\s*.*\\s*stimulate[sd]?\\s*.*\\s*" + ENT_name,
          ENT_name_1 + "\\s*.*\\s*bind(s|ed)?\\s*.*\\s*" + ENT_name,
          "association of\\s*.*\\s*" + ENT_name_1 + "\\s*.*\\s*with\\s*.*\\s*" + ENT_name,
          ENT_name_1 + "\\s*.*\\s*interact(s|ed)? with\\s*.*\\s*" + ENT_name,
          "interaction (between|among)\\s*.*\\s*" + ENT_name + "\\s*.*\\s*and\\s*.*\\s*" + ENT_name,
          ENT_name_1 + "\\s*.*\\s*" + ENT_name + " interaction",
          ENT_name_1 + "\\s*.*\\s*" + ENT_name + " binding",
          ENT_name_1 + "\\s*.*\\s*" + ENT_name + " interact",
          ENT_name_1 + "\\s*.*\\s*associates? with\\s*.*\\s*" + ENT_name,
          "association between\\s*.*\\s*" + ENT_name_1 + "\\s*.*\\s*and\\s*.*\\s*" + ENT_name,
          ENT_name_1
              + "\\s*.*\\s*and\\s*.*\\s*"
              + ENT_name
              + " \\s*.*\\s*association with each other",
          ENT_name_1 + "\\s*.*\\s*binds? to\\s*.*\\s*" + ENT_name,
          "binding of\\s*.*\\s*" + ENT_name_1 + "\\s*.*\\s*to\\s*.*\\s*" + ENT_name,
          ENT_name_1 + " and " + ENT_name + " bind",
          "binding between " + ENT_name_1 + " and " + ENT_name,
          "complex " + ENT_name_1 + " and " + ENT_name,
          ENT_name_1 + " complex with " + ENT_name,
          ENT_name_1 + " complex " + ENT_name,
          ENT_name_1 + "\\s*.*\\s*not (interact|associate|bind|complex)\\s*.*\\s*" + ENT_name,
          ENT_name_1 + "\\s*.*\\s*but not " + ENT_name,
        };

    for (int i = 0; i < patterns.length; i++) {
      if (sen.matches(".*" + patterns[i] + ".*")) {
        String[] feature =
            new String[] {
              "Pattern-" + i + "@",
            };
        GenericFeatVect.addNewFeatureInList(
            feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
        //	System.out.println(sen + "\n" + patterns[i] + "\n");
      }
    }
  }
예제 #5
0
  /**
   * @param curSen
   * @param listFeatIndsOfCurInp
   * @param listFeatCountOfCurInp
   * @param e1
   * @param e2
   */
  private void extractNonTargetEntityFeatures(
      Sentence curSen,
      ArrayList<Integer> listFeatIndsOfCurInp,
      ArrayList<Integer> listFeatCountOfCurInp,
      Entity e1,
      Entity e2) {

    for (int e = 0; e < curSen.listOfEntities.size(); e++) {

      Entity entOther = curSen.listOfEntities.get(e);

      if (entOther.getNEcategory().equalsIgnoreCase("DISO")) {

        GenericFeatVect.addNewFeatureInList(
            new String[] {"DISOinsideSentence"}, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);

        //	System.out.println(entOther.id);
        DepTreeNode headOfEnt =
            curSen.depTree.getHeadWordFromWordBoundaries(
                entOther.getAllWordIndexes(), true, curSen);

        int hwiOfEntOther = headOfEnt.wordIndex;

        int wiOfImmediateGovernor = getNonConjGovernorIndex(curSen, hwiOfEntOther);

        if (wiOfImmediateGovernor < 0) continue;

        int wiOfNearestVerbGovernor = getNearestVerbGovernor(wiOfImmediateGovernor, curSen);

        ArrayList<Integer> listOfWIofEntities = new ArrayList<Integer>();
        listOfWIofEntities.addAll(e1.getAllWordIndexes());
        listOfWIofEntities.addAll(e2.getAllWordIndexes());

        // detect whether drugs are dependent of the verb governor
        if (wiOfNearestVerbGovernor > -1
            && curSen.depTree.allNodesByWordIndex[wiOfNearestVerbGovernor].governAllWIsInList(
                listOfWIofEntities)) {
          /*
          GenericFeatVect.addNewFeatureInList( new String[]{"bothEntDependOnVerbGovernorOfTheDISO"}, 1,
          		listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
          //*/
          GenericFeatVect.addNewFeatureInList(
              new String[] {
                "nearestVerbGovernorOfTheDISO="
                    + curSen.arrLemmasByParser[wiOfNearestVerbGovernor].toLowerCase()
              },
              1,
              listFeatIndsOfCurInp,
              listFeatCountOfCurInp,
              1);
          // */
        }

        if (wiOfImmediateGovernor > -1
            && curSen.depTree.allNodesByWordIndex[wiOfImmediateGovernor].governAllWIsInList(
                listOfWIofEntities)) {
          /*
          GenericFeatVect.addNewFeatureInList( new String[]{"bothEntDependOnImmediateGovernorOfTheDISO"}, 1,
          			listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
          //*/
          GenericFeatVect.addNewFeatureInList(
              new String[] {
                "immediateGovernorOfTheDISO="
                    + curSen.arrLemmasByParser[wiOfImmediateGovernor].toLowerCase()
              },
              1,
              listFeatIndsOfCurInp,
              listFeatCountOfCurInp,
              1);
          //	*/
        }
        // *
        if (wiOfImmediateGovernor == wiOfNearestVerbGovernor)
          GenericFeatVect.addNewFeatureInList(
              new String[] {"immediateGovernorIsVerbGovernorOfTheDISO"},
              1,
              listFeatIndsOfCurInp,
              listFeatCountOfCurInp,
              1);
        //	*/
      }
    }
  }
예제 #6
0
  /**
   * @param curSen
   * @param listFeatIndsOfCurInp
   * @param listFeatCountOfCurInp
   * @param e1
   * @param e2
   * @param negWI
   * @param listOfReducedGraph
   */
  private void extractNegationScopeFeatures(
      Sentence curSen,
      ArrayList<Integer> listFeatIndsOfCurInp,
      ArrayList<Integer> listFeatCountOfCurInp,
      Entity e1,
      Entity e2,
      int negWI,
      ArrayList<Integer> listOfReducedGraph) {

    int wiOfImmediateGovernor = getNonConjGovernorIndex(curSen, negWI);

    if (!listOfReducedGraph.contains(wiOfImmediateGovernor) || wiOfImmediateGovernor < 0) return;

    int wiOfNearestVerbGovernor = getNearestVerbGovernor(wiOfImmediateGovernor, curSen);

    //	int dist = 0;

    // *
    if (!listOfReducedGraph.contains(wiOfNearestVerbGovernor)
    // ||
    // dist > 3
    ) wiOfNearestVerbGovernor = -1;
    /*
    if ( wiOfNearestVerbGovernor > -1 &&
    		curSen.depTree.allNodesByWordIndex[wiOfNearestVerbGovernor].getParentsWordIndexes().isEmpty()
    	)
    	GenericFeatVect.addNewFeatureInList( new String[]{"verbGovernorIsRoot"}, 1,
    			listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
    */

    ArrayList<Integer> listOfWIofEntities = new ArrayList<Integer>();
    listOfWIofEntities.addAll(e1.getAllWordIndexes());
    listOfWIofEntities.addAll(e2.getAllWordIndexes());

    /*
    // detect whether drugs are dependent of the verb governor
    if ( wiOfNearestVerbGovernor > -1
    		&& curSen.depTree.allNodesByWordIndex[wiOfNearestVerbGovernor].governAllWIsInList(listOfWIofEntities) )
    	GenericFeatVect.addNewFeatureInList( new String[]{"bothEntDependOnVerbGovernor"}, 1,
    			listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
    */
    if (wiOfImmediateGovernor > -1
        && curSen.depTree.allNodesByWordIndex[wiOfImmediateGovernor].governAllWIsInList(
            listOfWIofEntities))
      GenericFeatVect.addNewFeatureInList(
          new String[] {"bothEntDependOnImmediateGovernor"},
          1,
          listFeatIndsOfCurInp,
          listFeatCountOfCurInp,
          1);

    if (wiOfImmediateGovernor == wiOfNearestVerbGovernor)
      GenericFeatVect.addNewFeatureInList(
          new String[] {"immediateGovernorIsVerbGovernor"},
          1,
          listFeatIndsOfCurInp,
          listFeatCountOfCurInp,
          1);
    /*
    GenericFeatVect.addNewFeatureInList( new String[]{"immediateGovernor="
    			+ curSen.arrLemmasByParser[wiOfImmediateGovernor].toLowerCase()}, 1,
    			listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);
    //*/
    if (wiOfNearestVerbGovernor > -1)
      GenericFeatVect.addNewFeatureInList(
          new String[] {
            "nearestVerbGovernor=" + curSen.arrLemmasByParser[wiOfNearestVerbGovernor].toLowerCase()
          },
          1,
          listFeatIndsOfCurInp,
          listFeatCountOfCurInp,
          1);
    //		*/
  }
예제 #7
0
  /**
   * @param dn
   * @param prevRelType
   * @param listFeatIndsOfCurInp
   * @param listFeatCountOfCurInp
   * @throws IOException
   */
  private void createFeaturesFromInputGraph(
      DependencyTree dt,
      DepTreeNode dn,
      String prevRelType,
      ArrayList<Integer> listFeatIndsOfCurInp,
      ArrayList<Integer> listFeatCountOfCurInp,
      ArrayList<Integer> listOfNodeTraversed,
      int[] e1Boundaries,
      int[] e2Boundaries)
      throws IOException {
    // TODO: what will happen if there is multiple root?

    int weight = 1;
    //	cc++;
    listOfNodeTraversed.add(dn.wordIndex);

    // if ( isEntityButNotOneOfTheTargetEntities(dn, e1Boundaries, e2Boundaries) )
    // dn.lemma = "ENTITYother";

    // System.out.println(cc);

    String[] feature = new String[0];

    // */
    // BFS traversal

    for (int i = 0; i < dn.getChildrenWordIndexes().size(); i++) {
      // *
      /*
      // v-walk
      feature =  new String[] {
      		dn.lemma + "@" + dn.relNamesWithChildren.get(i) + "@" + dn.children.get(i).lemma,
      		dn.children.get(i).lemma + "@" + dn.relNamesWithChildren.get(i) + "@" + dn.lemma
      };
      //addNewFeatureInList(feature, listFeatIndsOfCurInp, listFeatCountOfCurInp);
      */

      //	FileUtility.writeInFile( vectOutFile, feature[0] + "\n", true);

      feature =
          new String[] {
            dn.pos + "@" + dn.getRelNamesWithChildren().get(i) + "@" + dn.getChildren().get(i).pos,
            dn.getChildren().get(i).pos + "@" + dn.getRelNamesWithChildren().get(i) + "@" + dn.pos
          };
      GenericFeatVect.addNewFeatureInList(
          feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, weight);
      // */
      // e-walk
      if (!prevRelType.isEmpty()) {
        feature =
            new String[] {
              prevRelType + "#" + dn.pos + "#" + dn.getRelNamesWithChildren().get(i),
              dn.getRelNamesWithChildren().get(i) + "#" + dn.pos + "#" + prevRelType
            };
        GenericFeatVect.addNewFeatureInList(
            feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, weight);

        feature =
            new String[] {
              prevRelType + "#" + dn.lemma + "#" + dn.getRelNamesWithChildren().get(i),
              dn.getRelNamesWithChildren().get(i) + "#" + dn.lemma + "#" + prevRelType
            };
        GenericFeatVect.addNewFeatureInList(
            feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, weight);
      }

      for (int k = i + 1; k < dn.getChildrenWordIndexes().size(); k++) {

        // add e-walk for the siblings WITHOUT taking lexical order in consideration
        feature =
            new String[] {
              dn.getRelNamesWithChildren().get(i)
                  + "#"
                  + dn.pos
                  + "#"
                  + dn.getRelNamesWithChildren().get(k),
              dn.getRelNamesWithChildren().get(k)
                  + "#"
                  + dn.pos
                  + "#"
                  + dn.getRelNamesWithChildren().get(i)
            };
        GenericFeatVect.addNewFeatureInList(
            feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, weight);

        feature =
            new String[] {
              dn.getRelNamesWithChildren().get(i)
                  + "#"
                  + dn.lemma
                  + "#"
                  + dn.getRelNamesWithChildren().get(k),
              dn.getRelNamesWithChildren().get(k)
                  + "#"
                  + dn.lemma
                  + "#"
                  + dn.getRelNamesWithChildren().get(i),
            };
        GenericFeatVect.addNewFeatureInList(
            feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, weight);
        /*
        // 3-gram of siblings and parent
        feature = new String[] {
        		dn.children.get(i).lemma + "#" + dn.lemma + "#" + dn.children.get(k).lemma,
        		dn.children.get(k).lemma + "#" + dn.lemma + "#" + dn.children.get(i).lemma
        	};
        addNewFeatureInList(feature, listFeatIndsOfCurInp, listFeatCountOfCurInp);
        /*
        feature = new String[] {
        		dn.children.get(i).pos + "#" + dn.pos + "#" + dn.children.get(k).pos,
        		dn.children.get(k).pos + "#" + dn.pos + "#" + dn.children.get(i).pos
        	};
        addNewFeatureInList(feature, listFeatIndsOfCurInp, listFeatCountOfCurInp);
        */
      }
    }

    // for grand children
    for (int i = 0; i < dn.getChildrenWordIndexes().size(); i++) {
      if (!listOfNodeTraversed.contains(dn.getChildrenWordIndexes().get(i)))
        createFeaturesFromInputGraph(
            dt,
            dn.getChildren().get(i),
            dn.getRelNamesWithChildren().get(i),
            listFeatIndsOfCurInp,
            listFeatCountOfCurInp,
            listOfNodeTraversed,
            e1Boundaries,
            e2Boundaries);
    }

    // for parents
    for (int i = 0; dn.getParents() != null && i < dn.getParents().size(); i++) {
      /*
      for ( int c=0; c< dn.childrenWordIndex.size(); c++ ){
      	// 3-gram
      	feature = new String[] {
      			dn.getParents().get(i).lemma + "#" + dn.lemma + "#" + dn.children.get(c).lemma,
      			//dn.children.get(c).lemma + "#" + dn.lemma + "#" + dn.getParents().get(i).lemma
      		};
      	addNewFeatureInList(feature, listFeatIndsOfCurInp, listFeatCountOfCurInp);
      }
      */
      if (!listOfNodeTraversed.contains(dn.getParents().get(i).wordIndex)) {
        createFeaturesFromInputGraph(
            dt,
            dn.getParents().get(i),
            "",
            listFeatIndsOfCurInp,
            listFeatCountOfCurInp,
            listOfNodeTraversed,
            e1Boundaries,
            e2Boundaries);
      }
    }
  }
예제 #8
0
  /**
   * @param isSimplifyEntity
   * @param tokenWithPos
   * @param senID
   * @param sentence
   * @param listEnt
   * @param listRel
   * @param listDependencies
   * @param medtType
   * @param isResolveOverlappingEntities
   * @param relToBeConsidered
   * @param arrClauseBoundOfSen
   * @return
   * @throws IOException
   */
  public boolean setInpVectFromDepGraphOfPairsAndTrigger(
      Relation objRel,
      Sentence objCurSen,
      int medtType,
      boolean discardDepRelUsingProbabilityInReducedGraph,
      boolean useWalkFeatures,
      boolean useRegExPatterns,
      boolean useDepPatterns,
      boolean useTriggers,
      boolean triggersFromWholeRGinsteadOfLCP,
      boolean useNegativeCues,
      Entity e1,
      Entity e2)
      throws IOException {

    ArrayList<Integer> listFeatIndsOfCurInp = new ArrayList<Integer>(),
        listFeatCountOfCurInp = new ArrayList<Integer>();

    DepTreeNode
        headOfEnt1 =
            objCurSen.depTree.getHeadWordFromWordBoundaries(
                e1.getAllWordIndexes(), true, objCurSen),
        headOfEnt2 =
            objCurSen.depTree.getHeadWordFromWordBoundaries(
                e2.getAllWordIndexes(), true, objCurSen);

    DepTreeNode dn = null;

    //	System.out.println(e1.id + "  " + e2.id);

    // All nodes in the shortest path connecting the target pairs must be retained
    // All nodes satisfying the 3 rules of MEDT kernel must be retained
    dn =
        objCurSen
            .depTree
            .clone()
            .findMinimalSubTreeWithEntities(false, headOfEnt1, medtType, headOfEnt2);

    /*
     *  If there is no minimal subtree/path between target entities then we do not consider to generate
     *  instance for training/testing.
     */
    if (dn == null) {
      FileUtility.writeInFile(
          GenericFeatVect.vectOutFile,
          e1.id + " " + e1.name + "\t" + e2.id + " " + e2.name + "\n\n",
          true);

      FileUtility.writeInFile(GenericFeatVect.vectOutFile, objCurSen.text + "\n\n", true);

      return false;
    }

    GenericFeatVect.listOfAllInstances.add(
        e1.id + " " + e1.name + "\t" + e2.id + " " + e2.name + "\n\n" + objCurSen.text + "\n\n");

    // Construct feature set using e-walks and v-walks
    if (dn != null && useWalkFeatures) {

      createNgramFeatures(objCurSen.depTree, 1, e1, listFeatIndsOfCurInp, listFeatCountOfCurInp);
      createNgramFeatures(objCurSen.depTree, 1, e2, listFeatIndsOfCurInp, listFeatCountOfCurInp);

      // System.out.println(objCurSen.senID + "  " + dn.wordIndex);
      objCurSen.depTree.replaceEntitiesWithDummies(
          dn, e1.boundaries, e2.boundaries, new ArrayList<Integer>());
      createFeaturesFromInputGraph(
          objCurSen.depTree,
          dn,
          "",
          listFeatIndsOfCurInp,
          listFeatCountOfCurInp,
          new ArrayList<Integer>(),
          e1.boundaries,
          e2.boundaries);
    }

    if (useRegExPatterns) {
      matchPPIpatternOnSentence(
          objCurSen.text, e1.name, e2.name, listFeatIndsOfCurInp, listFeatCountOfCurInp);
      matchPPIpatternOnSentence(
          objCurSen.text, e2.name, e1.name, listFeatIndsOfCurInp, listFeatCountOfCurInp);
    }

    ArrayList<String> listOfDepRelsInReducedGraph = new ArrayList<String>();

    ArrayList<ArrayList<Integer>> listNodesAndLCP =
        new PatternsDepRelFromGraph()
            .extractDepRelsInReducedGraph(
                objRel,
                objCurSen,
                listOfDepRelsInReducedGraph,
                discardDepRelUsingProbabilityInReducedGraph,
                false);

    if (useDepPatterns)
      extractDepPatternFeatures(
          listOfDepRelsInReducedGraph, listFeatIndsOfCurInp, listFeatCountOfCurInp);

    //  NOTE: listNodesAndLCP has two elements - (0) all the nodes in Reduced graph, and (1) the
    // least common parents (LCPs) in Reduced graph.

    if (listNodesAndLCP == null) listNodesAndLCP = new ArrayList<ArrayList<Integer>>();

    if (useTriggers && listNodesAndLCP.size() > 0) {
      if (triggersFromWholeRGinsteadOfLCP)
        for (int i = 0; i < listNodesAndLCP.get(0).size(); i++)
          addTriggerWordFeatures(
              objCurSen.depGraph.allNodesByWordIndex[listNodesAndLCP.get(0).get(i)].word,
              listFeatIndsOfCurInp,
              listFeatCountOfCurInp);
      else
        for (int i = 0; i < listNodesAndLCP.get(1).size(); i++)
          addTriggerWordFeatures(
              objCurSen.depGraph.allNodesByWordIndex[listNodesAndLCP.get(1).get(i)].word,
              listFeatIndsOfCurInp,
              listFeatCountOfCurInp);
    }
    // *
    if (useNegativeCues && listNodesAndLCP.size() > 0) {

      for (int i = 0; i < listNodesAndLCP.get(0).size(); i++) {
        // System.out.println(objCurSen.senID + "  " + dn.wordIndex);
        // addNegativeWordFeatures( graph.allNodesByWordIndex[listNodesAndLCP.get(0).get(i)].word,
        // listFeatIndsOfCurInp, listFeatCountOfCurInp);

        if (Triggers.listOfNegativeWords.contains(
            objCurSen.depGraph.allNodesByWordIndex[listNodesAndLCP.get(0).get(i)].lemma)) {

          // add a feature indicating that there is a negative word in the reduced graph
          String[] feature =
              new String[] {
                "HasNegWord@$"
                    + objCurSen.depGraph.allNodesByWordIndex[listNodesAndLCP.get(0).get(i)].lemma,
              };

          GenericFeatVect.addNewFeatureInList(
              feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);

          if (objCurSen.depGraph.allNodesByWordIndex[listNodesAndLCP.get(0).get(i) + 1].lemma
                  .equalsIgnoreCase("be")
              || objCurSen.depGraph.allNodesByWordIndex[listNodesAndLCP.get(0).get(i) + 1].pos
                  .equalsIgnoreCase("IN")) {
            feature =
                new String[] {
                  "WordNextToNegCue@$"
                      + objCurSen
                          .depGraph
                          .allNodesByWordIndex[listNodesAndLCP.get(0).get(i) + 2]
                          .lemma,
                };
          } else {
            feature =
                new String[] {
                  "WordNextToNegCue@$"
                      + objCurSen
                          .depGraph
                          .allNodesByWordIndex[listNodesAndLCP.get(0).get(i) + 1]
                          .lemma,
                };
          }

          GenericFeatVect.addNewFeatureInList(
              feature, 1, listFeatIndsOfCurInp, listFeatCountOfCurInp, 1);

          // *
          // extract negation scope features
          if (objCurSen.depGraph.allNodesByWordIndex[listNodesAndLCP.get(0).get(i)].lemma.matches(
              "(no|not)"))
            extractNegationScopeFeatures(
                objCurSen,
                listFeatIndsOfCurInp,
                listFeatCountOfCurInp,
                e1,
                e2,
                listNodesAndLCP.get(0).get(i),
                listNodesAndLCP.get(0));
          // */

        }
      }
    }
    // */

    // add Zhou et al. 2005 features
    new ExtAceFeatVect()
        .getZhouEtAl2005FeatVal(objCurSen, e1, e2, listFeatIndsOfCurInp, listFeatCountOfCurInp);

    extractNonTargetEntityFeatures(objCurSen, listFeatIndsOfCurInp, listFeatCountOfCurInp, e1, e2);

    GenericFeatVect.sortFeatValByIndx(listFeatIndsOfCurInp, listFeatCountOfCurInp);

    GenericFeatVect.listOfAllInstancesWithFeat.add(listFeatIndsOfCurInp);
    GenericFeatVect.listOfAllInstancesWithFeatCount.add(listFeatCountOfCurInp);

    return true;
  }