| 
|
QuoteRef: coheJD7_1997
topics >
all references >
ThesaHelp:
ACM references a-e
ThesaHelp:
references c-d
Topic:
hash table and hash functions
Reference
Cohen, J.D., "Recursive hashing functions for n-grams", ACM Transactions on Information Systems, 15, 3, pp. 291-320, July 1997. Google
abstract ;;Quote: use a recursive hash function to compute hash values for consecutive n-grams; up to 7 times faster than nonrecursive integer division; e.g. for indexing all character sequences in a document
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references c-d (337 items)
Topic: hash table and hash functions (41 items)