Interface | Description |
---|---|
AhoCorasickDoubleArrayTrie.IHit<V> |
Processor handles the output when hit a keyword
|
AhoCorasickDoubleArrayTrie.IHitFull<V> |
Processor handles the output when hit a keyword, with more detail
|
Class | Description |
---|---|
AhoCorasickDoubleArrayTrie<V> |
An implemention of Aho Corasick algorithm based on Double Array Trie
|
DictionaryTrie |
词首字索引式前缀树
前缀树的Java实现
为前缀树的一级节点(词首字)建立索引(比二分查找要快)
用于查找一个指定的字符串是否在词典中
|
DoubleArrayDictionaryTrie |
双数组前缀树的Java实现
用于查找一个指定的字符串是否在词典中
An Implementation of Double-Array Trie: http://linux.thai.net/~thep/datrie/datrie.html
|
Copyright © 2014–2015 APDPlat. All rights reserved.