|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface RiTextNode
| Method Summary | |
|---|---|
RiTextNode |
addChild(char c,
int initialCount)
|
RiTextNode |
addChild(java.lang.String newToken)
If the newToken does not exist as a child, creates a new
child node with a frequency of 1 (e.g., else increments the existing
child node's frequency by 1. |
RiTextNode |
addChild(java.lang.String newToken,
int initialCount)
If the newToken does not exist as a child, creates a new
child node with initialCount as its frequency (e.g.,
for smoothing), else increments the existing child nodes frequency
by 1 |
java.lang.String |
asTree(boolean sort)
|
java.util.Iterator |
childIterator()
|
int |
compareTo(java.lang.Object o)
|
java.util.Map |
getChildMap()
|
java.util.Collection |
getChildNodes()
|
java.util.List |
getChildNodes(java.lang.String regex)
Returns a List of all children matching the supplied regular expression. |
int |
getCount()
|
float |
getProbability()
|
java.lang.String |
getToken()
|
boolean |
hasChildren()
|
boolean |
hasChildren(java.lang.String regex)
Return true if the node has at least one child matching the given regular expression (if one is supplied). |
int |
increment()
|
boolean |
isIgnoringCase()
|
boolean |
isLeaf()
|
boolean |
isRoot()
|
boolean |
isSentenceStart()
|
RiTextNode |
lookup(char charToLookup)
Does a lookup on the children of this node and returns any nodes that match charToLookup, else returns null. |
RiTextNode |
lookup(RiTextNode tokenToLookup)
Does a lookup on the children of this node and returns any nodes that match tokenToLookup, else returns null. |
RiTextNode |
lookup(java.lang.String tokenToLookup)
Does a lookup on the children of this node and returns any nodes that match tokenToLookup, else returns null. |
int |
numChildren()
Returns number of children of this node |
void |
pathFromRoot(java.util.Stack result)
|
RiTextNode |
selectChild()
|
RiTextNode |
selectChild(boolean probabalisticSelect)
|
RiTextNode |
selectChild(java.lang.String regex,
boolean probabalisticSelect)
|
void |
setCount(int initialCount)
|
void |
setIgnoreCase(boolean b)
|
void |
setIsSentenceStart(boolean isSentenceStart)
|
java.lang.String |
toString()
|
int |
uniqueCount()
|
| Method Detail |
|---|
RiTextNode addChild(java.lang.String newToken)
newToken does not exist as a child, creates a new
child node with a frequency of 1 (e.g., else increments the existing
child node's frequency by 1.
newToken -
RiTextNode addChild(char c,
int initialCount)
RiTextNode addChild(java.lang.String newToken,
int initialCount)
newToken does not exist as a child, creates a new
child node with initialCount as its frequency (e.g.,
for smoothing), else increments the existing child nodes frequency
by 1
newToken - initialCount -
java.lang.String getToken()
int getCount()
int increment()
java.lang.String toString()
toString in class java.lang.Objectboolean isRoot()
void pathFromRoot(java.util.Stack result)
int uniqueCount()
float getProbability()
java.util.Iterator childIterator()
int numChildren()
int compareTo(java.lang.Object o)
RiTextNode lookup(java.lang.String tokenToLookup)
tokenToLookup, else returns null.
RiTextNode lookup(RiTextNode tokenToLookup)
tokenToLookup, else returns null.
RiTextNode lookup(char charToLookup)
charToLookup, else returns null.
java.util.Collection getChildNodes()
java.lang.String asTree(boolean sort)
boolean isLeaf()
void setIgnoreCase(boolean b)
boolean isIgnoringCase()
RiTextNode selectChild()
RiTextNode selectChild(boolean probabalisticSelect)
RiTextNode selectChild(java.lang.String regex,
boolean probabalisticSelect)
java.util.List getChildNodes(java.lang.String regex)
regex -
boolean hasChildren(java.lang.String regex)
boolean hasChildren()
java.util.Map getChildMap()
boolean isSentenceStart()
void setIsSentenceStart(boolean isSentenceStart)
void setCount(int initialCount)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||