|
MaltParser 1.4.1 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectjava.util.Observable
org.maltparser.core.syntaxgraph.GraphElement
org.maltparser.core.syntaxgraph.node.GraphNode
org.maltparser.core.syntaxgraph.node.Token
public class Token
| Field Summary | |
|---|---|
protected DependencyNode |
component
a reference to a node where the node is part of a component. |
protected SortedSet<DependencyNode> |
heads
|
protected int |
index
|
protected SortedSet<DependencyNode> |
leftDependents
|
protected PhraseStructureNode |
parent
|
protected TokenNode |
predecessor
the previous terminal node in the linear precedence |
protected int |
rank
|
protected SortedSet<DependencyNode> |
rightDependents
|
protected TokenNode |
successor
the next terminal node in the linear precedence |
| Fields inherited from class org.maltparser.core.syntaxgraph.node.GraphNode |
|---|
incomingEdges, outgoingEdges |
| Constructor Summary | |
|---|---|
Token()
|
|
| Method Summary | |
|---|---|
void |
addHeadEdgeLabel(LabelSet labelSet)
|
void |
addHeadEdgeLabel(SymbolTable table,
int code)
|
void |
addHeadEdgeLabel(SymbolTable table,
String symbol)
|
void |
addIncomingEdge(Edge in)
|
void |
addOutgoingEdge(Edge out)
|
void |
clear()
Resets the graph element. |
int |
compareTo(ComparableNode that)
|
boolean |
equals(Object obj)
|
DependencyNode |
findComponent()
|
DependencyNode |
getAncestor()
|
DependencyNode |
getClosestLeftDependent()
Returns the closest left dependent to the node it self, if not found null is returned. |
DependencyNode |
getClosestRightDependent()
Returns the closest right dependent to the node it self, if not found null is returned. |
int |
getCompareToIndex()
Returns the index of the node (only used internal by compareTo). |
DependencyNode |
getComponent()
|
protected void |
getDependencyDominationSet(SortedSet<DependencyNode> dominationSet)
|
int |
getDependencyNodeDepth()
Returns the depth of the node. |
DependencyNode |
getHead()
Returns the head dependency node if it exists, otherwise null. |
Edge |
getHeadEdge()
Returns the edge between the head and the node if it exists, otherwise null. |
int |
getHeadEdgeLabelCode(SymbolTable table)
|
LabelSet |
getHeadEdgeLabelSet()
|
String |
getHeadEdgeLabelSymbol(SymbolTable table)
|
Set<SymbolTable> |
getHeadEdgeLabelTypes()
|
Set<Edge> |
getHeadEdges()
|
Set<DependencyNode> |
getHeads()
|
int |
getIndex()
Returns the index of the node. |
DependencyNode |
getLeftDependent(int index)
Returns the left dependent at the position index, where index==0 equals the left most dependent. |
int |
getLeftDependentCount()
Return the number of left dependents |
SortedSet<DependencyNode> |
getLeftDependents()
Returns a sorted set of left dependents. |
DependencyNode |
getLeftmostDependent()
|
ComparableNode |
getLeftmostDescendant()
Returns the left-most terminal descendant node. |
ComparableNode |
getLeftmostProperDescendant()
Returns the left-most proper terminal descendant node (excluding itself). |
DependencyNode |
getLeftSibling()
Returns the left sibling if it exists, otherwise null |
PhraseStructureNode |
getParent()
|
Edge |
getParentEdge()
|
int |
getParentEdgeLabelCode(SymbolTable table)
|
String |
getParentEdgeLabelSymbol(SymbolTable table)
|
TokenNode |
getPredecessor()
Returns the predecessor terminal node in the linear order of the terminal nodes. |
DependencyNode |
getProperAncestor()
|
int |
getRank()
|
DependencyNode |
getRightDependent(int index)
|
int |
getRightDependentCount()
Return the number of right dependents |
SortedSet<DependencyNode> |
getRightDependents()
Returns a sorted set of right dependents. |
DependencyNode |
getRightmostDependent()
|
ComparableNode |
getRightmostDescendant()
Returns the right-most terminal descendant node. |
ComparableNode |
getRightmostProperDescendant()
Returns the right-most proper terminal descendant node (excluding itself). |
DependencyNode |
getRightSibling()
Returns the right sibling if it exists, otherwise null |
DependencyNode |
getSameSideLeftSibling()
Returns the left sibling at the same side of head as the node it self. |
DependencyNode |
getSameSideRightSibling()
Returns the right sibling at the same side of head as the node it self. |
TokenNode |
getSuccessor()
Returns the successor terminal node in the linear order of the terminal nodes. |
boolean |
hasAncestorInside(int left,
int right)
|
boolean |
hasAtMostOneHead()
Returns true if the node has at most one head, otherwise false. |
boolean |
hasDependent()
|
int |
hashCode()
|
boolean |
hasHead()
Returns true if the node has one or more head(s), otherwise false. |
boolean |
hasHeadEdgeLabel(SymbolTable table)
|
boolean |
hasLeftDependent()
Returns true if the node has one or more left dependents, otherwise false. |
boolean |
hasParentEdgeLabel(SymbolTable table)
|
boolean |
hasRightDependent()
Returns true if the node has one or more right dependents, otherwise false. |
boolean |
isHeadEdgeLabeled()
|
boolean |
isProjective()
Returns true if the head edge is projective, otherwise false. |
boolean |
isRoot()
Returns true if the node is a root node, otherwise false. |
int |
nHeadEdgeLabels()
|
void |
removeIncomingEdge(Edge in)
|
void |
removeOutgoingEdge(Edge out)
|
void |
setComponent(DependencyNode x)
|
void |
setIndex(int index)
|
void |
setPredecessor(TokenNode predecessor)
Sets the predecessor terminal node in the linear order of the terminal nodes. |
void |
setRank(int r)
|
void |
setSuccessor(TokenNode successor)
Sets the predecessor terminal node in the linear order of the terminal nodes. |
String |
toString()
|
| Methods inherited from class org.maltparser.core.syntaxgraph.node.GraphNode |
|---|
getIncomingEdgeIterator, getIncomingSecondaryEdges, getInDegree, getLeftmostDescendantIndex, getLeftmostProperDescendantIndex, getOutDegree, getOutgoingEdgeIterator, getOutgoingSecondaryEdges, getRightmostDescendantIndex, getRightmostProperDescendantIndex |
| Methods inherited from class org.maltparser.core.syntaxgraph.GraphElement |
|---|
addLabel, addLabel, addLabel, compareTo, getBelongsToGraph, getLabelCode, getLabelSet, getLabelSymbol, getLabelTypes, hasLabel, isLabeled, nLabels, removeLabel, removeLabels, setBelongsToGraph |
| Methods inherited from class java.util.Observable |
|---|
addObserver, clearChanged, countObservers, deleteObserver, deleteObservers, hasChanged, notifyObservers, notifyObservers, setChanged |
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface org.maltparser.core.syntaxgraph.node.ComparableNode |
|---|
getIncomingSecondaryEdges, getInDegree, getLeftmostDescendantIndex, getLeftmostProperDescendantIndex, getOutDegree, getOutgoingSecondaryEdges, getRightmostDescendantIndex, getRightmostProperDescendantIndex |
| Methods inherited from interface org.maltparser.core.syntaxgraph.Element |
|---|
addLabel, addLabel, addLabel, getBelongsToGraph, getLabelCode, getLabelSet, getLabelSymbol, getLabelTypes, hasLabel, isLabeled, nLabels, removeLabel, removeLabels, setBelongsToGraph |
| Field Detail |
|---|
protected TokenNode predecessor
protected TokenNode successor
protected DependencyNode component
protected int rank
protected int index
protected PhraseStructureNode parent
protected final SortedSet<DependencyNode> heads
protected final SortedSet<DependencyNode> leftDependents
protected final SortedSet<DependencyNode> rightDependents
| Constructor Detail |
|---|
public Token()
throws MaltChainedException
MaltChainedException| Method Detail |
|---|
public void setPredecessor(TokenNode predecessor)
setPredecessor in interface TokenNodepredecessor - the predecessor terminal nodepublic void setSuccessor(TokenNode successor)
setSuccessor in interface TokenNodesuccessor - the successor terminal nodepublic TokenNode getPredecessor()
getPredecessor in interface TokenNodepublic TokenNode getSuccessor()
getSuccessor in interface TokenNodepublic int getRank()
getRank in interface DependencyNodepublic void setRank(int r)
setRank in interface DependencyNodepublic DependencyNode findComponent()
findComponent in interface DependencyNodepublic DependencyNode getComponent()
getComponent in interface DependencyNodepublic void setComponent(DependencyNode x)
setComponent in interface DependencyNode
public void addIncomingEdge(Edge in)
throws MaltChainedException
addIncomingEdge in interface NodeaddIncomingEdge in class GraphNodeMaltChainedException
public void removeIncomingEdge(Edge in)
throws MaltChainedException
removeIncomingEdge in interface NoderemoveIncomingEdge in class GraphNodeMaltChainedException
public void addOutgoingEdge(Edge out)
throws MaltChainedException
addOutgoingEdge in interface NodeaddOutgoingEdge in class GraphNodeMaltChainedException
public void removeOutgoingEdge(Edge out)
throws MaltChainedException
removeOutgoingEdge in interface NoderemoveOutgoingEdge in class GraphNodeMaltChainedException
public void setIndex(int index)
throws MaltChainedException
setIndex in interface NodesetIndex in class GraphNodeMaltChainedExceptionpublic int getIndex()
ComparableNode
getIndex in interface ComparableNodegetIndex in class GraphNodepublic int getCompareToIndex()
ComparableNode
getCompareToIndex in interface ComparableNodepublic boolean isRoot()
ComparableNode
isRoot in interface ComparableNodeisRoot in class GraphNode
public DependencyNode getAncestor()
throws MaltChainedException
getAncestor in interface DependencyNodeMaltChainedException
public DependencyNode getProperAncestor()
throws MaltChainedException
getProperAncestor in interface DependencyNodeMaltChainedException
public ComparableNode getLeftmostProperDescendant()
throws MaltChainedException
ComparableNode
getLeftmostProperDescendant in interface ComparableNodeMaltChainedException
public ComparableNode getRightmostProperDescendant()
throws MaltChainedException
ComparableNode
getRightmostProperDescendant in interface ComparableNodeMaltChainedException
public ComparableNode getLeftmostDescendant()
throws MaltChainedException
ComparableNode
getLeftmostDescendant in interface ComparableNodeMaltChainedException
public ComparableNode getRightmostDescendant()
throws MaltChainedException
ComparableNode
getRightmostDescendant in interface ComparableNodeMaltChainedExceptionpublic PhraseStructureNode getParent()
getParent in interface PhraseStructureNode
public Edge getParentEdge()
throws MaltChainedException
getParentEdge in interface PhraseStructureNodeMaltChainedException
public String getParentEdgeLabelSymbol(SymbolTable table)
throws MaltChainedException
getParentEdgeLabelSymbol in interface PhraseStructureNodeMaltChainedException
public int getParentEdgeLabelCode(SymbolTable table)
throws MaltChainedException
getParentEdgeLabelCode in interface PhraseStructureNodeMaltChainedException
public boolean hasParentEdgeLabel(SymbolTable table)
throws MaltChainedException
hasParentEdgeLabel in interface PhraseStructureNodeMaltChainedExceptionpublic boolean hasAtMostOneHead()
DependencyNode
hasAtMostOneHead in interface DependencyNode
public boolean hasAncestorInside(int left,
int right)
throws MaltChainedException
hasAncestorInside in interface DependencyNodeMaltChainedException
public Set<Edge> getHeadEdges()
throws MaltChainedException
getHeadEdges in interface DependencyNodeMaltChainedException
public Set<DependencyNode> getHeads()
throws MaltChainedException
getHeads in interface DependencyNodeMaltChainedExceptionpublic boolean hasHead()
DependencyNode
hasHead in interface DependencyNode
public DependencyNode getHead()
throws MaltChainedException
DependencyNode
getHead in interface DependencyNodeMaltChainedException
public Edge getHeadEdge()
throws MaltChainedException
DependencyNode
getHeadEdge in interface DependencyNodeMaltChainedException
public void addHeadEdgeLabel(SymbolTable table,
String symbol)
throws MaltChainedException
addHeadEdgeLabel in interface DependencyNodeMaltChainedException
public void addHeadEdgeLabel(SymbolTable table,
int code)
throws MaltChainedException
addHeadEdgeLabel in interface DependencyNodeMaltChainedException
public void addHeadEdgeLabel(LabelSet labelSet)
throws MaltChainedException
addHeadEdgeLabel in interface DependencyNodeMaltChainedException
public boolean hasHeadEdgeLabel(SymbolTable table)
throws MaltChainedException
hasHeadEdgeLabel in interface DependencyNodeMaltChainedException
public String getHeadEdgeLabelSymbol(SymbolTable table)
throws MaltChainedException
getHeadEdgeLabelSymbol in interface DependencyNodeMaltChainedException
public int getHeadEdgeLabelCode(SymbolTable table)
throws MaltChainedException
getHeadEdgeLabelCode in interface DependencyNodeMaltChainedException
public boolean isHeadEdgeLabeled()
throws MaltChainedException
isHeadEdgeLabeled in interface DependencyNodeMaltChainedException
public int nHeadEdgeLabels()
throws MaltChainedException
nHeadEdgeLabels in interface DependencyNodeMaltChainedException
public Set<SymbolTable> getHeadEdgeLabelTypes()
throws MaltChainedException
getHeadEdgeLabelTypes in interface DependencyNodeMaltChainedException
public LabelSet getHeadEdgeLabelSet()
throws MaltChainedException
getHeadEdgeLabelSet in interface DependencyNodeMaltChainedExceptionpublic boolean hasDependent()
hasDependent in interface DependencyNodepublic boolean hasLeftDependent()
true if the node has one or more left dependents, otherwise false.
hasLeftDependent in interface DependencyNodetrue if the node has one or more left dependents, otherwise false.public DependencyNode getLeftDependent(int index)
index, where index==0 equals the left most dependent.
getLeftDependent in interface DependencyNodeindex - the index
index, where index==0 equals the left most dependentpublic int getLeftDependentCount()
getLeftDependentCount in interface DependencyNodepublic SortedSet<DependencyNode> getLeftDependents()
DependencyNode
getLeftDependents in interface DependencyNode
public DependencyNode getLeftSibling()
throws MaltChainedException
null
getLeftSibling in interface DependencyNodenull
MaltChainedException
public DependencyNode getSameSideLeftSibling()
throws MaltChainedException
null
getSameSideLeftSibling in interface DependencyNodenullThrows:
MaltChainedExceptionpublic DependencyNode getClosestLeftDependent()
null is returned.
getClosestLeftDependent in interface DependencyNodenull is returned.public DependencyNode getLeftmostDependent()
getLeftmostDependent in interface DependencyNodepublic DependencyNode getRightDependent(int index)
getRightDependent in interface DependencyNodepublic int getRightDependentCount()
getRightDependentCount in interface DependencyNodepublic SortedSet<DependencyNode> getRightDependents()
getRightDependents in interface DependencyNode
public DependencyNode getRightSibling()
throws MaltChainedException
null
getRightSibling in interface DependencyNodenull
MaltChainedException
public DependencyNode getSameSideRightSibling()
throws MaltChainedException
null
getSameSideRightSibling in interface DependencyNodenullThrows:
MaltChainedExceptionpublic DependencyNode getClosestRightDependent()
null is returned.
getClosestRightDependent in interface DependencyNodenull is returned.public DependencyNode getRightmostDependent()
getRightmostDependent in interface DependencyNodeprotected void getDependencyDominationSet(SortedSet<DependencyNode> dominationSet)
public boolean hasRightDependent()
true if the node has one or more right dependents, otherwise false.
hasRightDependent in interface DependencyNodetrue if the node has one or more right dependents, otherwise false.
public boolean isProjective()
throws MaltChainedException
DependencyNode
isProjective in interface DependencyNodeMaltChainedException
public int getDependencyNodeDepth()
throws MaltChainedException
DependencyNode
getDependencyNodeDepth in interface DependencyNodeMaltChainedException
public void clear()
throws MaltChainedException
GraphElement
clear in interface Elementclear in class GraphNodeMaltChainedExceptionpublic int compareTo(ComparableNode that)
compareTo in interface Comparable<ComparableNode>compareTo in class GraphNodepublic boolean equals(Object obj)
equals in class GraphNodepublic int hashCode()
hashCode in class GraphNodepublic String toString()
toString in class GraphNode
|
MaltParser 1.4.1 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||