最大正向匹配分词



public void fenci() {

int j = 0;
int kp =0;

while(j < sentence.length()){

for(int i = maxlength;i >0;i--){

kp = i+j;
if(kp > sentence.length()){
kp = sentence.length();
}
String key = sentence.substring(j, kp).trim();

if(LoadDictionary.hashmap.containsKey(key)){
set.add(key);
j += i;
break;
}
if (i == 1) { // 如果字典中没有这个字,则直接切出 
                    j++; 
                    set.add(key); 
                    break; 
                } 

}
}

}

猜你喜欢

转载自wwangcg.iteye.com/blog/1327745