Examples of IndexedWord

edu.stanford.nlp.ling.IndexedWord
This class is mainly for use with RTE in terms of the methods it provides, but on a more general level, it provides a {@link CoreLabel} that uses itsDocIDAnnotation, SentenceIndexAnnotation, and IndexAnnotation to implement Comparable/compareTo, hashCode, and equals. This means no other annotations, including the identity of the word, are taken into account when using these methods.
The actual implementation is to wrap a CoreLabel. This avoids breaking the equals() and hashCode() contract and also avoids expensive copying when used to represent the same data as the original CoreLabel. @author rafferty



Examples of edu.stanford.nlp.ling.IndexedWord
137
138
139
140
141
142
143
144
145
146
147     Set<List<TypedDependency>> depLists = Generics.newHashSet();
    List<TypedDependency> children = govToDepMap.get(gov);


    if (depth > 0 && children != null) {
      for (TypedDependency child : children) {
        IndexedWord childNode = child.dep();
        if (childNode == null) continue;
        Set<List<TypedDependency>> childDepLists = getGovMaxChains(govToDepMap, childNode, depth-1);
        if (childDepLists.size() != 0) {
          for (List<TypedDependency> childDepList : childDepLists) {
            List<TypedDependency> depList = new ArrayList<TypedDependency>(childDepList.size() + 1);

View Full Code Here



Examples of edu.stanford.nlp.ling.IndexedWord
25
26
27
28
29
30
31
32
33   return new AddNode(nodeString, nodeName);
}


  @Override
  public void evaluate(SemanticGraph sg, SemgrexMatcher sm) {
    IndexedWord newNode = AddDep.fromCheapString(nodeString);
    sg.addVertex(newNode);
    addNamedNode(newNode, nodeName);
  }

View Full Code Here

Examples of edu.stanford.nlp.ling.IndexedWord
20
21
22
23
24
25
26
27
28
29     this.nodeName = nodeName;
  }


  @Override
  public void evaluate(SemanticGraph sg, SemgrexMatcher sm) {
   IndexedWord tgtNode = getNamedNode(nodeName, sm);
   for (SemanticGraphEdge edge : sg.incomingEdgeIterable(tgtNode)) {
     sg.removeEdge(edge);
   }
  }

View Full Code Here

Examples of edu.stanford.nlp.ling.IndexedWord
116
117
118
119
120
121
122
123
124
125
126
127
128
129   public String toString(CoreLabel.OutputFormat format) {
    return reln + "(" + gov.toString(format) + ", " + dep.toString(format) + ")";
  }


  public int compareTo(TypedDependency tdArg) {
    IndexedWord depArg = tdArg.dep();
    IndexedWord depThis = this.dep();
    int indexArg = depArg.index();
    int indexThis = depThis.index();


    if (indexThis > indexArg) {
      return 1;
    } else if (indexThis < indexArg) {
      return -1;

View Full Code Here

Examples of edu.stanford.nlp.ling.IndexedWord
200
201
202
203
204
205
206
207
208
209
210     for (TypedDependency rcmod : list) {
      if (rcmod.reln() != RELATIVE_CLAUSE_MODIFIER) {
        continue;
      }


      IndexedWord head = rcmod.gov();
      if (depNodes == null) {
        depNodes = Generics.newArrayList();
      } else {
        depNodes.clear();
      }

View Full Code Here

Examples of edu.stanford.nlp.ling.IndexedWord
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557     Collection<TypedDependency> newTypedDeps = new ArrayList<TypedDependency>(list);


    // find typed deps of form conj(gov,dep)
    for (TypedDependency td : list) {
      if (EnglishGrammaticalRelations.getConjs().contains(td.reln())) {
        IndexedWord gov = td.gov();
        IndexedWord dep = td.dep();


        // look at the dep in the conjunct
        Set<TypedDependency> gov_relations = map.get(gov);
        // System.err.println("gov " + gov);
        if (gov_relations != null) {
          for (TypedDependency td1 : gov_relations) {
            // System.err.println("gov rel " + td1);
            IndexedWord newGov = td1.gov();
            // in the case of errors in the basic dependencies, it
            // is possible to have overlapping newGov & dep
            if (newGov.equals(dep)) {
              continue;
            }
            GrammaticalRelation newRel = td1.reln();
            if (newRel != ROOT) {
              if (rcmodHeads.contains(gov) && rcmodHeads.contains(dep)) {

View Full Code Here

Examples of edu.stanford.nlp.ling.IndexedWord
654
655
656
657
658
659
660
661
662
663
664   private static void collapseConj(Collection<TypedDependency> list) {
    List<IndexedWord> govs = Generics.newArrayList();
    // find typed deps of form cc(gov, dep)
    for (TypedDependency td : list) {
      if (td.reln() == COORDINATION) { // i.e. "cc"
        IndexedWord gov = td.gov();
        GrammaticalRelation conj = conjValue(td.dep().value());
        if (DEBUG) {
          System.err.println("Set conj to " + conj + " based on " + td);
        }


View Full Code Here

Examples of edu.stanford.nlp.ling.IndexedWord
716
717
718
719
720
721
722
723
724
725
726
727       }
    }


    // now substitute target of referent where possible
    for (TypedDependency ref : refs) {
      IndexedWord dep = ref.dep();// take the relative word
      IndexedWord ant = ref.gov();// take the antecedent
      for (TypedDependency td : list) {
        // the last condition below maybe shouldn't be necessary, but it has
        // helped stop things going haywire a couple of times (it stops the
        // creation of a unit cycle that probably leaves something else
        // disconnected) [cdm Jan 2010]

View Full Code Here

Examples of edu.stanford.nlp.ling.IndexedWord
750
751
752
753
754
755
756
757
758
759
760
761       if (rcmod.reln() != RELATIVE_CLAUSE_MODIFIER) {
        // we only add ref dependencies across relative clauses
        continue;
      }


      IndexedWord head = rcmod.gov();
      IndexedWord modifier = rcmod.dep();


      TypedDependency leftChild = null;
      for (TypedDependency child : list) {
        if (child.gov().equals(modifier) &&
            EnglishPatterns.RELATIVIZING_WORD_PATTERN.matcher(child.dep().value()).matches() &&

View Full Code Here

Examples of edu.stanford.nlp.ling.IndexedWord
818
819
820
821
822
823
824
825
826
827
828
829       if (xcomp.reln() != XCLAUSAL_COMPLEMENT) {
        // we only add extra nsubj dependencies to some xcomp dependencies
        continue;
      }


      IndexedWord modifier = xcomp.dep();
      IndexedWord head = xcomp.gov();


      boolean hasSubjectDaughter = false;
      boolean hasAux = false;
      List<IndexedWord> subjects = Generics.newArrayList();
      List<IndexedWord> objects = Generics.newArrayList();

View Full Code Here


0
1
2
3
4
5



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.