一种对英文字符串进行分词的方法  

English String Segmentation Method

作　　者：邹智敏[1] 郭荷清[1] 高英[1] 

机构地区：[1]华南理工大学计算机科学与工程学院,广东广州510641

出　　处：《计算机应用研究》2007年第7期52-54,共3页Application Research of Computers

基　　金：国家"973"计划资助项目(G20000263);广州市重点科技攻关资助项目(B2-109-550)

摘　　要：对Aho-Corasick算法略作改变,用一个收词丰富的有优先级的字典构造Aho-Corasick树,并利用它对英文字符串进行字典匹配。对匹配的结果,利用后缀词按优先级排序的特点设计了一个高效的分词算法。实验证明该算法具有高效性。Aho-Corasick algorithm was changed slightly, and a priority-ranked dictionary with plentiful words was used to construct Aho-Corasick tree. A dictionary pattern matching was carried out using this tree. Observing the suffix words were ordered by priority in the result of dictionary pattern matching, a high efficient algorithm was designed to segment English string. The experiment also proves the algorithm＇s efficiency.

关 键 词：字典匹配 英文分词 后缀词 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]