| 
|
Quote: compress hash values for spelling list by storing differences; partition into M bins for speed
topics >
all references >
references m-o >
Topic:
hash filter
Topic:
spelling errors
Quotation Skeleton
Thus by storing differences we may expect to … [Uses a Huffman code to 27 bits/hash value into 13.60 bits] … To look up a hash value, one must … indeed. However, by partitioning the table of differences … up much space. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: hash filter (18 items)
Topic: spelling errors (18 items)