public int cuted(final int depth, final int wordIndex, final int candIndex) {
    final int l = Math.max(0, depth - effectEditDistance); // min chars from word to consider - 1
    final int u = Math.min(wordLen - 1 - (wordIndex - depth), depth + effectEditDistance); // max chars from word to
    // consider - 1
    int minEd = effectEditDistance + 1; // what is to be computed
    int wi = wordIndex + l - depth;
    int d;

    for (int i = l; i <= u; i++, wi++) {
      if ((d = ed(i, depth, wi, candIndex)) < minEd) {
        minEd = d;
      }
    }
    return minEd;
  }
public int cuted ( final int depth , final int wordIndex , final int candIndex ) { final int l = Math . max ( 0 , depth - effectEditDistance ) ; final int u = Math . min ( wordLen - 1 - ( wordIndex - depth ) , depth + effectEditDistance ) ; int minEd = effectEditDistance + 1 ; int wi = wordIndex + l - depth ; int d ; for ( int i = l ; i <= u ; i ++ , wi ++ ) { if ( ( d = ed ( i , depth , wi , candIndex ) ) < minEd ) { minEd = d ; } } return minEd ; }
Calculates cut-off edit distance.

@param depth current length of candidates.
@param wordIndex (TODO: javadoc?)
@param candIndex (TODO: javadoc?)
@return Cut-off edit distance. Remarks: See Oflazer.