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
Open PDFAbstract
Available in full text
Date
October 1, 2010
Authors
Publisher
Elsevier BV
Available in full text
October 1, 2010
Elsevier BV