"Recursive n-gram hashing is pairwise independent, at best."

Daniel Lemire, Owen Kaser (2010)

> Home

Details and statistics

DOI: 10.1016/J.CSL.2009.12.001

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/csl/LemireK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/csl/LemireK10
Daniel Lemire, Owen Kaser:
Recursive n-gram hashing is pairwise independent, at best. Comput. Speech Lang. 24(4): 698-710 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.