smile.hash

Interface SimHash<T>

public interface SimHash<T>

SimHash is a technique for quickly estimating how similar two sets are. The algorithm is used by the Google Crawler to find near duplicate pages.

Method Summary

Modifier and Type	Method and Description
long	hash(T x)
static SimHash<int[]>	of(byte[][] features) Returns the SimHash for a set of generic features (represented as byte[]).
static SimHash<java.lang.String[]>	text() Returns the SimHash for string tokens.

Method Detail

hash

long hash(T x)

of

static SimHash<int[]> of(byte[][] features)

Returns the SimHash for a set of generic features (represented as byte[]).

text

static SimHash<java.lang.String[]> text()

Returns the SimHash for string tokens.