| 
|
QuoteRef: coheJD12_1998
topics >
all references >
ThesaHelp:
references c-d
Topic:
sort algorithms
Topic:
hash table and hash functions
Topic:
sub-sequences
Topic:
approximate string matching and pattern matching with errors
Topic:
full-text indexing
Topic:
external search and sort
Reference
Cohen, J.D., "An n-gram hash and skip algorithm for finding large numbers of keywords in continuous text streams", Software-Practice and Experience, 28, 15, pp. 1605-1635, December 25, 1998. Google
abstract ;;Quote: use n-gram-hash-and-skip for matching keywords in a large dictionary of 10,000-100,000 entries
1606 ;;Quote: n-grams of text streams are efficient, robust, and capture statistically significant phrases
ThesaHelp: references c-d (337 items)
Topic: sort algorithms (24 items)
Topic: hash table and hash functions (41 items)
Topic: sub-sequences (13 items)
Topic: approximate string matching and pattern matching with errors (19 items)
Topic: full-text indexing (35 items)
Topic: external search and sort (23 items)