高庆狮, 李莉, 刘宏岚. 基于语义单元表示树剪枝的关键字过滤方法[J]. 工程科学学报, 2006, 28(12): 1191-1195. DOI: 10.13374/j.issn1001-053x.2006.12.042
引用本文: 高庆狮, 李莉, 刘宏岚. 基于语义单元表示树剪枝的关键字过滤方法[J]. 工程科学学报, 2006, 28(12): 1191-1195. DOI: 10.13374/j.issn1001-053x.2006.12.042
GAO Qingshi, LI Li, LIU Honglan. Key word filter method based on pruning on the tree representations of semantic elements[J]. Chinese Journal of Engineering, 2006, 28(12): 1191-1195. DOI: 10.13374/j.issn1001-053x.2006.12.042
Citation: GAO Qingshi, LI Li, LIU Honglan. Key word filter method based on pruning on the tree representations of semantic elements[J]. Chinese Journal of Engineering, 2006, 28(12): 1191-1195. DOI: 10.13374/j.issn1001-053x.2006.12.042

基于语义单元表示树剪枝的关键字过滤方法

Key word filter method based on pruning on the tree representations of semantic elements

  • 摘要: 传统的关键字过滤技术满足了人们一定的需要,但是其灵活性差,效果有限,难以识别和过滤变形过的关键字.本文将语义单元应用在网络监测中,提出了一种新的关键字过滤方法.这种方法可以有效地识别和过滤网络中经过变形的关键字,其时间复杂度为O(L)而非O(LN),其中L是文本的长度,N是关键字集的规模,即无论关键字集有多么大的规模,算法消耗的时间是固定不变的,这对网络监测和信息过滤有着较强的实用性.

     

    Abstract: Traditional key word filtering technology meets people's common need, but the flexibility and effect is too limited to recognize or filter the transformed key words. Semantic elements were applied to net monitor and a new key word filter method was proposed. This method could recognize and filter the transformed key words effectively. The filter time was O(L) rather than general O(LN), where L was the length of text and N was the size of Keyword-base. It means this algorithm costs constant time even if N is hundreds of thousands or millions. It is very practical in net monitor and information filter.

     

/

返回文章
返回