module Classify:Classification, using KNN tree structure.sig..end
val lg : float -> floatval float_sum : float list -> floatval distances_to_distribution : 'a list -> float -> (float * 'b * 'a) list -> ('a * float) listIt's inefficient to list all the keys, but simpler to implement this way.
alphabet - the alphabet
a - the amount of prob. mass to give to all letters (in other words, we're linearly interpolating between a uniform distribution and whatever the nearest-neighbor tree gives
neighbors - the nearest neighbors
val sample_from_dist : (float * 'a) list -> 'aval one_letter_cross_entropy : ('a * float) list -> 'a -> float