Home » lucene-3.0.1-src » org.apache.lucene.analysis.cn.smart.hhmm » [javadoc | source]
org.apache.lucene.analysis.cn.smart.hhmm
class: BiSegGraph [javadoc | source]
java.lang.Object
   org.apache.lucene.analysis.cn.smart.hhmm.BiSegGraph
Graph representing possible token pairs (bigrams) at each start offset in the sentence.

For each start offset, a list of possible token pairs is stored.

WARNING: The status of the analyzers/smartcn analysis.cn.smart package is experimental. The APIs and file formats introduced here might change in the future and will not be supported anymore in such a case.

Constructor:
 public BiSegGraph(SegGraph segGraph) 
Method from org.apache.lucene.analysis.cn.smart.hhmm.BiSegGraph Summary:
addSegTokenPair,   getShortPath,   getToCount,   getToList,   isToExist,   toString
Methods from java.lang.Object:
clone,   equals,   finalize,   getClass,   hashCode,   notify,   notifyAll,   toString,   wait,   wait,   wait
Method from org.apache.lucene.analysis.cn.smart.hhmm.BiSegGraph Detail:
 public  void addSegTokenPair(SegTokenPair tokenPair) 
 public List<SegToken> getShortPath() 
    Find the shortest path with the Viterbi algorithm.
 public int getToCount() 
 public List<SegTokenPair> getToList(int to) 
    Return a List of all token pairs at this offset (index of the second token)
 public boolean isToExist(int to) 
    Returns true if their is a list of token pairs at this offset (index of the second token)
 public String toString()