Uses of Interface org.maltparser.core.syntaxgraph.node.DependencyNode (MaltParser 1.4.1)
Date: 2010-07-15

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| MaltParser 1.4.1
PREV NEXT | FRAMES NO FRAMES

## Uses of Interface
org.maltparser.core.syntaxgraph.node.DependencyNode

Packages that use DependencyNode
org.maltparser.core.syntaxgraph |
org.maltparser.core.syntaxgraph.node |
org.maltparser.parser.algorithm.covington | Implements the Covington deterministic parsing algorithms.
org.maltparser.parser.algorithm.nivre | Implements the Nivre deterministic parsing algorithms.
org.maltparser.parser.algorithm.planar |
org.maltparser.parser.algorithm.stack | Implements the Stack parsing algorithms.
org.maltparser.parser.algorithm.twoplanar |

Uses of DependencyNode in org.maltparser.core.syntaxgraph

Methods in org.maltparser.core.syntaxgraph that return DependencyNode
`DependencyNode` | `DependencyStructure.addDependencyNode()`
`DependencyNode` | `MappablePhraseStructureGraph.addDependencyNode()`
`DependencyNode` | `DependencyGraph.addDependencyNode()`
`DependencyNode` | `DependencyStructure.addDependencyNode(int index)`
`DependencyNode` | `MappablePhraseStructureGraph.addDependencyNode(int index)`
`DependencyNode` | `DependencyGraph.addDependencyNode(int index)`
`DependencyNode` | `DependencyStructure.getDependencyNode(int index)` Returns the dependency node identified by index if it exists, otherwise null.
`DependencyNode` | `MappablePhraseStructureGraph.getDependencyNode(int index)`
`DependencyNode` | `DependencyGraph.getDependencyNode(int index)`
`DependencyNode` | `DependencyStructure.getDependencyRoot()` Returns the root of the dependency structure.
`DependencyNode` | `MappablePhraseStructureGraph.getDependencyRoot()`
`DependencyNode` | `DependencyGraph.getDependencyRoot()`
`protected DependencyNode` | `MappablePhraseStructureGraph.link(DependencyNode x, DependencyNode y)`
`protected DependencyNode` | `DependencyGraph.link(DependencyNode x, DependencyNode y)`

Methods in org.maltparser.core.syntaxgraph with parameters of type DependencyNode
`Edge` | `MappablePhraseStructureGraph.addDependencyEdge(DependencyNode head, DependencyNode dependent)`
`protected Edge` | `DependencyGraph.addDependencyEdge(DependencyNode head, DependencyNode dependent)`
`protected DependencyNode` | `MappablePhraseStructureGraph.link(DependencyNode x, DependencyNode y)`
`protected DependencyNode` | `DependencyGraph.link(DependencyNode x, DependencyNode y)`
`Edge` | `MappablePhraseStructureGraph.moveDependencyEdge(DependencyNode newHead, DependencyNode dependent)`
`protected Edge` | `DependencyGraph.moveDependencyEdge(DependencyNode newHead, DependencyNode dependent)`

Uses of DependencyNode in org.maltparser.core.syntaxgraph.node

Subinterfaces of DependencyNode in org.maltparser.core.syntaxgraph.node
`interface` | `TokenNode`

Classes in org.maltparser.core.syntaxgraph.node that implement DependencyNode
`class` | `Root`
`class` | `Token`

Fields in org.maltparser.core.syntaxgraph.node declared as DependencyNode
`protected DependencyNode` | `Token.component` a reference to a node where the node is part of a component.
`protected DependencyNode` | `Root.component` a reference to a node where the node is part of a component.

Fields in org.maltparser.core.syntaxgraph.node with type parameters of type DependencyNode
`protected SortedSet<DependencyNode>` | `Token.heads`
`protected SortedSet<DependencyNode>` | `Token.leftDependents`
`protected SortedSet<DependencyNode>` | `Root.leftDependents`
`protected SortedSet<DependencyNode>` | `Token.rightDependents`
`protected SortedSet<DependencyNode>` | `Root.rightDependents`

Methods in org.maltparser.core.syntaxgraph.node that return DependencyNode
`DependencyNode` | `Token.findComponent()`
`DependencyNode` | `DependencyNode.findComponent()`
`DependencyNode` | `Root.findComponent()`
`DependencyNode` | `Token.getAncestor()`
`DependencyNode` | `DependencyNode.getAncestor()`
`DependencyNode` | `Root.getAncestor()`
`DependencyNode` | `Token.getClosestLeftDependent()` Returns the closest left dependent to the node it self, if not found `null` is returned.
`DependencyNode` | `DependencyNode.getClosestLeftDependent()` Returns the closest left dependent to the node it self, if not found `null` is returned.
`DependencyNode` | `Root.getClosestLeftDependent()` Returns the closest left dependent to the node it self, if not found `null` is returned.
`DependencyNode` | `Token.getClosestRightDependent()` Returns the closest right dependent to the node it self, if not found `null` is returned.
`DependencyNode` | `DependencyNode.getClosestRightDependent()` Returns the closest right dependent to the node it self, if not found `null` is returned.
`DependencyNode` | `Root.getClosestRightDependent()` Returns the closest right dependent to the node it self, if not found `null` is returned.
`DependencyNode` | `Token.getComponent()`
`DependencyNode` | `DependencyNode.getComponent()`
`DependencyNode` | `Root.getComponent()`
`DependencyNode` | `Token.getHead()`
`DependencyNode` | `DependencyNode.getHead()` Returns the head dependency node if it exists, otherwise null.
`DependencyNode` | `Root.getHead()`
`DependencyNode` | `Token.getLeftDependent(int index)` Returns the left dependent at the position `index`, where `index==0` equals the left most dependent.
`DependencyNode` | `DependencyNode.getLeftDependent(int index)` Returns the left dependent at the position index, where index==0 equals the left most dependent.
`DependencyNode` | `Root.getLeftDependent(int index)` Returns the left dependent at the position `index`, where `index==0` equals the left most dependent.
`DependencyNode` | `Token.getLeftmostDependent()`
`DependencyNode` | `DependencyNode.getLeftmostDependent()`
`DependencyNode` | `Root.getLeftmostDependent()`
`DependencyNode` | `Token.getLeftSibling()` Returns the left sibling if it exists, otherwise `null`
`DependencyNode` | `DependencyNode.getLeftSibling()` Returns the left sibling if it exists, otherwise `null`
`DependencyNode` | `Root.getLeftSibling()` Returns the left sibling if it exists, otherwise `null`
`DependencyNode` | `Token.getProperAncestor()`
`DependencyNode` | `DependencyNode.getProperAncestor()`
`DependencyNode` | `Root.getProperAncestor()`
`DependencyNode` | `Token.getRightDependent(int index)`
`DependencyNode` | `DependencyNode.getRightDependent(int index)`
`DependencyNode` | `Root.getRightDependent(int index)`
`DependencyNode` | `Token.getRightmostDependent()`
`DependencyNode` | `DependencyNode.getRightmostDependent()`
`DependencyNode` | `Root.getRightmostDependent()`
`DependencyNode` | `Token.getRightSibling()` Returns the right sibling if it exists, otherwise `null`
`DependencyNode` | `DependencyNode.getRightSibling()` Returns the right sibling if it exists, otherwise `null`
`DependencyNode` | `Root.getRightSibling()` Returns the right sibling if it exists, otherwise `null`
`DependencyNode` | `Token.getSameSideLeftSibling()` Returns the left sibling at the same side of head as the node it self.
`DependencyNode` | `DependencyNode.getSameSideLeftSibling()` Returns the left sibling at the same side of head as the node it self.
`DependencyNode` | `Root.getSameSideLeftSibling()` Returns the left sibling at the same side of head as the node it self.
`DependencyNode` | `Token.getSameSideRightSibling()` Returns the right sibling at the same side of head as the node it self.
`DependencyNode` | `DependencyNode.getSameSideRightSibling()` Returns the right sibling at the same side of head as the node it self.
`DependencyNode` | `Root.getSameSideRightSibling()` Returns the right sibling at the same side of head as the node it self.

Methods in org.maltparser.core.syntaxgraph.node that return types with arguments of type DependencyNode
`Set<DependencyNode>` | `Token.getHeads()`
`Set<DependencyNode>` | `DependencyNode.getHeads()`
`Set<DependencyNode>` | `Root.getHeads()`
`SortedSet<DependencyNode>` | `Token.getLeftDependents()`
`SortedSet<DependencyNode>` | `DependencyNode.getLeftDependents()` Returns a sorted set of left dependents.
`SortedSet<DependencyNode>` | `Root.getLeftDependents()`
`SortedSet<DependencyNode>` | `Token.getRightDependents()` Returns a sorted set of right dependents.
`SortedSet<DependencyNode>` | `DependencyNode.getRightDependents()` Returns a sorted set of right dependents.
`SortedSet<DependencyNode>` | `Root.getRightDependents()`

Methods in org.maltparser.core.syntaxgraph.node with parameters of type DependencyNode
`void` | `Token.setComponent(DependencyNode x)`
`void` | `DependencyNode.setComponent(DependencyNode x)`
`void` | `Root.setComponent(DependencyNode x)`

Method parameters in org.maltparser.core.syntaxgraph.node with type arguments of type DependencyNode
`protected void` | `Token.getDependencyDominationSet(SortedSet<DependencyNode> dominationSet)`
`protected void` | `Root.getDependencyDominationSet(SortedSet<DependencyNode> dominationSet)`

Uses of DependencyNode in org.maltparser.parser.algorithm.covington

Methods in org.maltparser.parser.algorithm.covington that return DependencyNode
`DependencyNode` | `CovingtonConfig.getLeftContextNode(int index)`
`DependencyNode` | `CovingtonConfig.getLeftNode(int index)`
`DependencyNode` | `CovingtonConfig.getLeftTarget()`
`DependencyNode` | `CovingtonConfig.getRightContextNode(int index)`
`DependencyNode` | `CovingtonConfig.getRightNode(int index)`
`DependencyNode` | `CovingtonConfig.getRightTarget()`

Methods in org.maltparser.parser.algorithm.covington that return types with arguments of type DependencyNode
`ArrayList<DependencyNode>` | `CovingtonConfig.getInput()`

Uses of DependencyNode in org.maltparser.parser.algorithm.nivre

Methods in org.maltparser.parser.algorithm.nivre that return DependencyNode
`DependencyNode` | `NivreConfig.getInputNode(int index)`
`DependencyNode` | `NivreConfig.getStackNode(int index)`

Methods in org.maltparser.parser.algorithm.nivre that return types with arguments of type DependencyNode
`Stack<DependencyNode>` | `NivreConfig.getInput()`
`Stack<DependencyNode>` | `NivreConfig.getStack()`

Uses of DependencyNode in org.maltparser.parser.algorithm.planar

Methods in org.maltparser.parser.algorithm.planar that return DependencyNode
`DependencyNode` | `PlanarConfig.getInputNode(int index)`
`DependencyNode` | `PlanarConfig.getStackNode(int index)`

Methods in org.maltparser.parser.algorithm.planar that return types with arguments of type DependencyNode
`Stack<DependencyNode>` | `PlanarConfig.getInput()`
`Stack<DependencyNode>` | `PlanarConfig.getStack()`

Uses of DependencyNode in org.maltparser.parser.algorithm.stack

Methods in org.maltparser.parser.algorithm.stack that return DependencyNode
`DependencyNode` | `StackConfig.getInputNode(int index)`
`DependencyNode` | `StackConfig.getLookaheadNode(int index)`
`DependencyNode` | `StackConfig.getStackNode(int index)`

Methods in org.maltparser.parser.algorithm.stack that return types with arguments of type DependencyNode
`Stack<DependencyNode>` | `StackConfig.getInput()`
`Stack<DependencyNode>` | `StackConfig.getStack()`

Uses of DependencyNode in org.maltparser.parser.algorithm.twoplanar

Methods in org.maltparser.parser.algorithm.twoplanar that return DependencyNode
`DependencyNode` | `TwoPlanarConfig.getActiveStackNode(int index)`
`DependencyNode` | `TwoPlanarConfig.getInactiveStackNode(int index)`
`DependencyNode` | `TwoPlanarConfig.getInputNode(int index)`

Methods in org.maltparser.parser.algorithm.twoplanar that return types with arguments of type DependencyNode
`Stack<DependencyNode>` | `TwoPlanarConfig.getActiveStack()`
`Stack<DependencyNode>` | `TwoPlanarConfig.getInactiveStack()`
`Stack<DependencyNode>` | `TwoPlanarConfig.getInput()`

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| MaltParser 1.4.1
PREV NEXT | FRAMES NO FRAMES

Copyright 2007-2010 Johan Hall, Jens Nilsson and Joakim Nivre.