private final SortedMap identifyCandidateDelimiters(String sStr,int iNGramSize){
  String sSubStr=null;
  Integer[] iRes=null;
  ArrayList alRes=new ArrayList();
  TreeMap tmRes=new TreeMap();
  for (int iCnt=0; iCnt <= sStr.length() - iNGramSize; iCnt++) {
    if (iCnt + iNGramSize > sStr.length())     continue;
    sSubStr=sStr.substring(iCnt,iCnt + iNGramSize);
    if (tmRes.containsValue(sSubStr))     continue;
    Vertex vStrNode=clLocator.locateVertexInGraph(sgOverallGraph,new VertexImpl(sSubStr));
    if (vStrNode == null)     continue;
    double dEntropy=getEntropyOfNextChar(sSubStr,false);
    tmRes.put(dEntropy,sSubStr);
  }
  return tmRes;
}

private final SortedMap identifyCandidateDelimiters ( String sStr , int iNGramSize ) { String sSubStr = null ; Integer [ ] iRes = null ; ArrayList alRes = new ArrayList ( ) ; TreeMap tmRes = new TreeMap ( ) ; for ( int iCnt = 0 ; iCnt <= sStr . length ( ) - iNGramSize ; iCnt ++ ) { if ( iCnt + iNGramSize > sStr . length ( ) ) continue ; sSubStr = sStr . substring ( iCnt , iCnt + iNGramSize ) ; if ( tmRes . containsValue ( sSubStr ) ) continue ; Vertex vStrNode = clLocator . locateVertexInGraph ( sgOverallGraph , new VertexImpl ( sSubStr ) ) ; if ( vStrNode == null ) continue ; double dEntropy = getEntropyOfNextChar ( sSubStr , false ) ; tmRes . put ( dEntropy , sSubStr ) ; } return tmRes ; }
returns a sorted map of candidate delimiters for a given string and a given n - gram size .
