Java 实现文章汉字关键词（违禁词）识别

package word; import jxl.Cell; import jxl.Sheet; import jxl.Workbook; import java.io.*; import java.util.ArrayList; import java.util.HashMap; import java.util.List; import java.util.Map; /** * Created by Administrator on 2016/3/22. * * @version $Revision$ $Date$ * 2016/3/22 * 14:09 * @author: Administrator * @since 3.0 */ public class TreeHelper { private Boolean isExit; //是否存在违禁词 private int maxLength; //记录树的最大长度 private int index; //最大匹配位置 private Map<String,TreeNode> map; //树根索引 private List<String> indexList; //记录关键词的位置 public static void main(String[] args) { TreeHelper treeHelper = new TreeHelper(); treeHelper.readXlsBuildTree("F:\\words.xls"); String str = "电热画在沈阳办公家具回收小鸡恒温设备品牌"; treeHelper.findWordLocation(str); System.out.println("源字符串："+str); System.out.println("树的最大长度为："+treeHelper.getMaxLength()); System.out.print("关键词队列："); for(String st : treeHelper.getIndexList()){ System.out.print(st); } } public TreeHelper(){ initTreeHelper(); } /** * TreeHelper初始化 */ public void initTreeHelper(){ isExit=false; maxLength = 0; index=0; map = new HashMap<String, TreeNode>(); } /** * 找出字符串中匹配关键词的位置 * @param str 待处理字符串 */ public void findWordLocation(String str){ indexList = new ArrayList<String>(); int first =0; String word = ""; while(true){ //从源字符串中取出小于或等于该树最大长度个数的字符串 if(first + maxLength < str.length()){ word = str.substring(first, first + maxLength); }else { //直到最后一个退出匹配 if(first == str.length()-2){ break; }else{ word = str.substring(first, str.length()); } } TreeNode node = map.get(word.substring(0, 1)); isExit = false; //重置原始状态 //树存在则查找 if (null != node) { findWord(node, word, 0); } //index > 0 说明树干存在关键词 if (0 != index) { String out = String.format("(%d,%d)",first,first+index ); indexList.add(out); } else { //index = 0 说明树叶存在关键词 if(isExit) { String out = String.format("(%d,%d)",first,first+index ); indexList.add(out); } } first++; //字符串起始位置后移 index =0; //重置全局变量 isExit =false; //重置全局变量 } } /** * 字符串挂载到树 * @param word 源字符串 */ public void dealWord(String word){ String temp = word.substring(0,1); TreeNode node = map.get(temp); //树不存在则创建树根，再创建树 if(null == node){ TreeNode rootNode = new TreeNode(); rootNode.setNodeName(temp); makeTree(rootNode, word, 0); map.put(temp, rootNode); }else{ //树存在，则更新树节点 makeTree(node,word,0); } } /** * 寻找子树匹配的关键词的位置 * @param treeNode 树节点 * @param word 待处理字符串 * @param first 字符串的起始位置 */ public void findWord(TreeNode treeNode, String word, int first){ //取出起始字符串 String temp = word.substring(first,first+1); //是否首字符串跟树根字符串相同 if(temp.equals(treeNode.getNodeName())){ //是否起始字符串在字符的最后位置 if(first != word.length() - 1) { //是否存在子节点 if (treeNode.getChildList().size() > 0) { //树干是否是关键词，不是则寻找下一个 if(1 != treeNode.getIsLast() ) { first++; findWord(treeNode, word, first); }else { //是树干节点则说明是关键词 index = first; isExit = true; return; } } else { //是叶节点则说明是关键词 index = first; isExit = true; return; } } } //是否叶节点 if(0 == treeNode.getChildList().size()){ //源字符串已经扫描完毕 if(first == word.length()-1){ //是叶节点则说明是关键词 index = first; isExit=true; return; } } else { //遍历子节点 for (TreeNode treeNode1 : treeNode.getChildList()) { //存在路径 if(temp.equals(treeNode1.getNodeName())) { //是关键词树干节点或叶节点，记录下来 if(1 == treeNode1.getIsLast() || 0 == treeNode1.getChildList().size()){ index = first; } //源字符串扫描完毕 if(first == word.length()-1) { //子节点是树干关键字，记录下来 if(1 == treeNode1.getIsLast()) { index = first; isExit = true; return; }else { //子节点是叶节点关键字，记录下来 if(0 == treeNode1.getChildList().size()){ index = first; isExit = true; return; }else { return; } } } //扫描下一个 first++; findWord(treeNode1, word, first); break; } } } } /** * 树的遍历 * @param treeNode 根节点 */ public void showTree(TreeNode treeNode){ System.out.println(treeNode.getNodeName()); for(TreeNode treeNode1 : treeNode.getChildList()){ showTree(treeNode1); } } /** * 创建树 * @param treeNode 节点 * @param word 待创建字符串 * @param first 字符串的起始位置 */ public void makeTree(TreeNode treeNode, String word, int first){ List<TreeNode> childList = treeNode.getChildList(); int flag=0; if(first == word.length()){ return; } String temp = word.substring(first,first+1); //是根节点 if(temp.equals(treeNode.getNodeName())){ flag =1; if(first != word.length()-1){ first++; makeTree(treeNode, word, first); }else { if(0 != first){ treeNode.setIsLast(1); } } }