Package edu.stanford.nlp.ling

Examples of edu.stanford.nlp.ling.IndexedWord

505
506
507
508
509
510
511
512
513
514
515
   *
   * @return collection of sibling nodes (does not include vertex)
   *         the collection is empty if your parent is null
   */
  public Collection<IndexedWord> getSiblings(IndexedWord vertex) {
    IndexedWord parent = this.getParent(vertex);
    if (parent != null) {
      Set<IndexedWord> result = wordMapFactory.newSet();
      result.addAll(this.getChildren(parent));
      result.remove(vertex);//remove this vertex - you're not your own sibling
      return result;
View Full Code Here
582
583
584
585
586
587
588
589
590
591
592
   * Returns the <em>first</em> {@link edu.stanford.nlp.ling.IndexedWord
   * IndexedWord} in this {@code SemanticGraph} having the given integer index,
   * or throws {@code IllegalArgumentException} if no such node is found.
   */
  public IndexedWord getNodeByIndex(int index) throws IllegalArgumentException {
    IndexedWord node = getNodeByIndexSafe(index);
    if (node == null)
      throw new IllegalArgumentException("No SemanticGraph vertex with index " + index);
    else
      return node;
  }
View Full Code Here
834
835
836
837
838
839
840
841
842
843
      for (IndexedWord inner : vertexSet()) {
        dominatedEdgeCount.incrementCount(outer, nodeDists.getCount(outer, inner));
      }
    }

    IndexedWord winner = Counters.argmax(dominatedEdgeCount);
    // TODO: account for multiply rooted graphs later
    setRoot(winner);

  }
View Full Code Here
871
872
873
874
875
876
877
878
879
880
881
  }

  private void topologicalSortHelper(IndexedWord vertex, Set<IndexedWord> temporary, Set<IndexedWord> permanent, List<IndexedWord> result) {
    temporary.add(vertex);
    for (SemanticGraphEdge edge : outgoingEdgeIterable(vertex)) {
      IndexedWord target = edge.getTarget();
      if (permanent.contains(target)) {
        continue;
      }
      if (temporary.contains(target)) {
        throw new IllegalStateException("This graph has cycles. Topological sort not possible: " + this.toString());
View Full Code Here
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
   */
  public boolean isDag() {
    Set<IndexedWord> unused = wordMapFactory.newSet();
    unused.addAll(vertexSet());
    while (!unused.isEmpty()) {
      IndexedWord arbitrary = unused.iterator().next();
      boolean result = isDagHelper(arbitrary, unused, wordMapFactory.newSet());
      if (result) {
        return false;
      }
    }
View Full Code Here
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
    }
    Set<IndexedWord> nodes = wordMapFactory.newSet();
    nodes.addAll(vertexSet());
    nodes.removeAll(used);
    while (!nodes.isEmpty()) {
      IndexedWord node = nodes.iterator().next();
      sb.append(node.toString(wordFormat)).append("\n");
      recToString(node, wordFormat, sb, 1, used);
      nodes.removeAll(used);
    }
    return sb.toString();
  }
View Full Code Here
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
  private void recToString(IndexedWord curr, CoreLabel.OutputFormat wordFormat, StringBuilder sb, int offset, Set<IndexedWord> used) {
    used.add(curr);
    List<SemanticGraphEdge> edges = outgoingEdgeList(curr);
    Collections.sort(edges);
    for (SemanticGraphEdge edge : edges) {
      IndexedWord target = edge.getTarget();
      sb.append(space(2 * offset)).append("-> ").append(target.toString(wordFormat)).append(" (").append(edge.getRelation()).append(")\n");
      if (!used.contains(target)) { // recurse
        recToString(target, wordFormat, sb, offset + 1, used);
      }
    }
  }
View Full Code Here
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
   *          Target List of words
   */
  private void insertSpecificIntoList(String specific, IndexedWord relnTgtNode, List<IndexedWord> tgtList) {
    int currIndex = tgtList.indexOf(relnTgtNode);
    Set<IndexedWord> descendants = descendants(relnTgtNode);
    IndexedWord specificNode = new IndexedWord();
    specificNode.set(CoreAnnotations.LemmaAnnotation.class, specific);
    specificNode.set(CoreAnnotations.TextAnnotation.class, specific);
    specificNode.set(CoreAnnotations.OriginalTextAnnotation.class, specific);
    while ((currIndex >= 1) && descendants.contains(tgtList.get(currIndex - 1))) {
      currIndex--;
    }
    tgtList.add(currIndex, specificNode);
  }
View Full Code Here
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
      if (showTags) {
        sb.append("/");
        sb.append(node.tag());
      }
      for (SemanticGraphEdge edge : getOutEdgesSorted(node)) {
        IndexedWord target = edge.getTarget();
        sb.append(" ").append(edge.getRelation()).append(":");
        if (!used.contains(target)) { // avoid infinite loop
          toCompactStringHelper(target, sb, used, showTags);
        } else {
          sb.append(target.word());
          if (showTags) {
            sb.append("/");
            sb.append(target.tag());
          }
        }
      }
      if (isntLeaf) {
        sb.append("]");
View Full Code Here
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
    if (prevToNewMap == null) {
      prevToNewMap = wordMapFactory.newMap();
    }
    Set<IndexedWord> vertexes = g.vertexSet();
    for (IndexedWord vertex : vertexes) {
      IndexedWord newVertex = new IndexedWord(vertex);
      addVertex(newVertex);
      prevToNewMap.put(vertex, newVertex);
    }

    roots = wordMapFactory.newSet();
    for (IndexedWord oldRoot : g.getRoots()) {
      roots.add(prevToNewMap.get(oldRoot));
    }
    for (SemanticGraphEdge edge : g.edgeIterable()) {
      IndexedWord newGov = prevToNewMap.get(edge.getGovernor());
      IndexedWord newDep = prevToNewMap.get(edge.getDependent());
      addEdge(newGov, newDep, edge.getRelation(), edge.getWeight(), edge.isExtra());
    }
  }
View Full Code Here
TOP

Related Classes of edu.stanford.nlp.ling.IndexedWord

  • edu.stanford.nlp.dcoref.Document
  • edu.stanford.nlp.dcoref.Mention
  • edu.stanford.nlp.dcoref.SingletonPredictor
  • edu.stanford.nlp.ie.machinereading.BasicRelationFeatureFactory
  • edu.stanford.nlp.parser.nndep.DependencyParser
  • edu.stanford.nlp.pipeline.AnnotationSerializer$IntermediateSemanticGraph
  • edu.stanford.nlp.pipeline.CoNLLOutputter
  • edu.stanford.nlp.pipeline.ProtobufAnnotationSerializer
  • edu.stanford.nlp.semgraph.SemanticGraph
  • edu.stanford.nlp.semgraph.SemanticGraph$SemanticGraphParsingTask
    • 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.