✳flâneur — a map of the web's best reading

SemanticGraph (Stanford CoreNLP API)

nlp.stanford.edu · 3,857 words · saved by 1 readers

Notes: The root is not at present represented as a vertex in the graph. At present you need to get a root/roots from the separate roots variable and to know about it. This should maybe be changed, because otherwise, doing things like simply getting the set of nodes or edges from the graph doesn't give you root nodes or edges. Given the kinds of representations that we normally use with typedDependenciesCollapsed, there can be (small) cycles in a SemanticGraph, and these cycles may involve the node that is conceptually the root of the graph, so there may be no node without a parent node. You can better get at the root(s) via the variable and methods provided. There is no mechanism for returning all edges at once (eg edgeSet()). This is intentional. Use edgeIterable() to iterate over the edges if necessary. Example: "[ate subj:Bill dobj:[muffins nn:blueberry]]" This is the same format generated by toCompactString(). © 2002-2013 Stanford NLP Group

SemanticGraph (Stanford CoreNLP API) Skip navigation links Overview Package Class Tree Deprecated Index Help Stanford CoreNLP API Prev Class Next Class Frames No Frames All Classes Summary: Nested | Field | Constr | Method Detail: Field | Constr | Method edu.stanford.nlp.semgraph Class SemanticGraph java.lang.Object edu.stanford.nlp.semgraph.SemanticGraph All Implemented Interfaces: Serializable public class SemanticGraph extends Object implements Serializable Represents a semantic graph of a sentence or document, with IndexedWord objects for nodes. Notes: The root is not at present represente

Explore this link on the map →

saved by

related reading