Recursive N-Gram Hashing Is Pairwise Independent, at Best

Computer Speech and Language - United States
doi 10.1016/j.csl.2009.12.001
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV


Related search