Download JAR files tagged by computed with all dependencies

This component takes as input a number of precomputed embeddings that are compatible with Flair and a UIMA type. If any annotations of the given type are found in a CAS, the embedding vectors for the words covered by the annotations are computed and written to file.

The Universal Numerical Fingerprint (UNF) is a cryptographic signature of the approximated semantic content of a digital object. It is computed on the normalized (or canonicalized) forms of the data values, and is thus independent of the storage medium and format of the data.

This package implements the parameter free version of the DILCA distance. This approach allows to learn value-to-value distances between each pair of values for each attribute of the dataset. The distance between two values is computed indirectly based on the their distribution w.r.t. a set of related attributes (the context) carefully chosen.

This module provides two packages, 'trees' and 'forests', which provide algorithms to compute edit distances on trees and forests (that is, unordered or ordered lists of trees) respectively. The edit distance is computed according to the tree edit distance algorithm of Zhang and Shasha (1989). The basic tree data structure is defined by the Tree interface in the trees module. Please refer to the javadoc for more detailed information.