List of typedDependencies() Examples

Examples of typedDependencies()

edu.stanford.nlp.semgraph.SemanticGraph.typedDependencies()
Returns a list of TypedDependency in the graph. This method goes through all SemanticGraphEdge and converts them to TypedDependency. @return A List of TypedDependency in the graph
edu.stanford.nlp.trees.GrammaticalStructure.typedDependencies()
Returns the typed dependencies of this grammatical structure. These are the basic word-level typed dependencies, where each word is dependent on one other thing, either a word or the starting ROOT, and the dependencies have a tree structure. This corresponds to the command-line option "basicDependencies". @return The typed dependencies of this grammatical structure

Examples of edu.stanford.nlp.semgraph.SemanticGraph.typedDependencies()

    pipeline.annotate(document);


    SemanticGraph ccProcessed = document.get(CoreAnnotations.SentencesAnnotation.class).get(0)
                                        .get(
                                            SemanticGraphCoreAnnotations.CollapsedCCProcessedDependenciesAnnotation.class);
    Collection<TypedDependency> dependencies = ccProcessed.typedDependencies();


    GrammaticalRelation expected = EnglishGrammaticalRelations.getConj("and");
    assertThat(dependencies.stream().map(d -> d.reln()).collect(toList()),
        hasItem(expected));
  }

View Full Code Here

Examples of edu.stanford.nlp.trees.GrammaticalStructure.typedDependencies()


    int numSentences = 0;
    for (List<TaggedWord> taggedSentence : tagged) {
      GrammaticalStructure parse = predict(taggedSentence);


      Collection<TypedDependency> deps = parse.typedDependencies();
      for (TypedDependency dep : deps)
        output.println(dep);
      output.println();


      numSentences++;

View Full Code Here

TOP

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.