public class AbstractCoOccurrences<T extends SequenceElement>
This class implements building cooccurrence map for abstract training corpus.
However it's performance rather low, due to exsessive IO that happens in ShadowCopyThread
PLEASE NOTE: Current implementation involves massive IO, and it should be rewritter as soon as ND4j gets sparse arrays support
public double getCoOccurrenceCount(@NonNull
This method returns cooccurrence distance weights for two SequenceElements
protected long getMemoryFootprint()
This method returns estimated memory footrpint, based on current CountMap content
protected long getMemoryThreshold()
This memory returns memory threshold, defined as 1/2 of memory allowed for allocation
public void fit()
public java.util.Iterator<Pair<Pair<T,T>,java.lang.Double>> iterator()
This method returns iterator with elements pairs and their weights. Resulting iterator is safe to use in multi-threaded environment.
Developer's note: thread safety on received iterator is delegated to PrefetchedSentenceIterator