| Package | Description |
|---|---|
| org.aksw.hawk.controller | |
| org.aksw.hawk.nlp | |
| org.aksw.hawk.nouncombination | |
| org.aksw.hawk.querybuilding | |
| org.aksw.hawk.ranking | |
| org.aksw.hawk.util |
| Modifier and Type | Method and Description |
|---|---|
private void |
StanfordNLPConnector.convertGraphStanford(MutableTreeNode parentMutableNode,
edu.stanford.nlp.ling.IndexedWord parentGraphWord,
edu.stanford.nlp.semgraph.SemanticGraph graph)
The recursive Function to convert a Semantic Graph into MutableTree
|
| Modifier and Type | Field and Description |
|---|---|
private MutableTreeNode |
MutableTreeNodeIterator.current |
MutableTreeNode |
MutableTreeNode.parent |
private MutableTreeNode |
MutableTreeNodeIterator.root |
private MutableTreeNode |
MutableTree.root |
| Modifier and Type | Field and Description |
|---|---|
List<MutableTreeNode> |
MutableTreeNode.children |
| Modifier and Type | Method and Description |
|---|---|
MutableTreeNode |
MutableTree.getRoot() |
MutableTreeNode |
MutableTreeNode.hardcopy(MutableTreeNode parent) |
MutableTreeNode |
MutableTreeNodeIterator.next() |
| Modifier and Type | Method and Description |
|---|---|
List<MutableTreeNode> |
MutableTree.getAllNodes()
Returns all Nodes in underlying sentence.
|
List<MutableTreeNode> |
MutableTree.getAllNodesInSentenceOrder()
Returns all Nodes in the same order they occur in underlying sentence.
|
List<MutableTreeNode> |
MutableTree.getAllNodesWithDepth(int depth) |
List<MutableTreeNode> |
MutableTreeNode.getChildren() |
List<MutableTreeNode> |
MutableTree.getPathToRoot(MutableTreeNode node) |
List<MutableTreeNode> |
MutableTreeNode.subNodes()
Returns all Nodes beneath this node.(Subtree)
|
| Modifier and Type | Method and Description |
|---|---|
void |
MutableTreeNode.addChild(MutableTreeNode newNode) |
int |
MutableTreeNode.compareTo(MutableTreeNode o) |
List<MutableTreeNode> |
MutableTree.getPathToRoot(MutableTreeNode node) |
MutableTreeNode |
MutableTreeNode.hardcopy(MutableTreeNode parent) |
private boolean |
MutableTreePruner.inorderRemovalBasedOnDependencyLabels(MutableTreeNode node,
MutableTree tree,
String depLabel) |
static String |
TreeTraversal.inorderTraversal(MutableTreeNode depNode,
int i,
StringBuilder sb) |
boolean |
MutableTree.remove(MutableTreeNode target) |
void |
MutableTree.setRoot(MutableTreeNode root) |
| Constructor and Description |
|---|
MutableTreeNode(String label,
String posTag,
String depLabel,
MutableTreeNode parent,
int i,
String lemma) |
MutableTreeNode(String label,
String posTag,
String depLabel,
MutableTreeNode parent,
int i,
String lemma,
int labelPosition) |
MutableTreeNodeIterator(MutableTreeNode root) |
| Modifier and Type | Method and Description |
|---|---|
private void |
StanfordCombinedNN.convert(MutableTreeNode parentNode,
HAWKQuestion q) |
| Modifier and Type | Method and Description |
|---|---|
private void |
RecursiveSparqlQueryBuilder.recursion(Set<SPARQLQuery> returnSet,
Set<String> variableSet,
MutableTreeNode tmp) |
| Modifier and Type | Method and Description |
|---|---|
protected static double |
TierRanker.getScoreForNode(MutableTreeNode node,
int nodeTier,
Set<String> clause) |
| Modifier and Type | Method and Description |
|---|---|
private static org.json.simple.JSONObject |
JSONStatusBuilder.recursiveNodeLabel(MutableTreeNode node,
org.json.simple.JSONObject document) |
Copyright © 2016–2017 Pivotal Software, Inc.. All rights reserved.