- anonymyizeNodes
Given an iterable set of distinct vertices, creates a new mapping that maps the
original vertices to
- edgesWithReln
Given a list of edges, returns those which match the given relation (can be
string or GrammaticalRel
- enRepairEdges
Given a graph, ensures all edges are EnglishGrammaticalRelations. NOTE: this is
English specific. NO
- getSubTreeEdgesHelper
- isTree
Checks whether a given SemanticGraph is a strict surface syntax tree.
- removeDuplicates
Given the set of graphs to remove duplicates from, also removes those on the
tabu graphs (and does n
- replaceNode
Replaces a node in the given SemanticGraph with the new node, replacing its
position in the node edg
- sanitizeForSemgrexName
Sanitizes the given string into a Semgrex friendly name
- semgrexFromGraph
Given a set of edges that form a rooted and connected graph, returns a Semgrex
pattern corresponding
- semgrexFromGraphHelper
Recursive call to generate the Semgrex pattern based off of this SemanticGraph.
nodeValuesTranformat
- tabuDescendantsHelper
Performs a cull for the descendants of the given node in the graph, subject to
the tabu nodes to avo
- leftMostChildVertice
Returns the vertice that is "leftmost." Note this requires that the
IndexedFeatureLabels present act