1. A computer implemented method of automatically mapping a given annotator to an aggregate of given annotators, comprising: providing, with one or more processors, a plurality of annotators stored on a machine-readable storage medium; providing, with the one or more processors, aggregates of the plurality of annotators; providing, with the one or more processors, an original document corpus stored on a machine-readable storage medium; applying, with the one or more processors, a subject annotator to the original document corpus to generate a corpus of subject annotated documents stored on a machine-readable storage medium; generating, with the one or more processors, a corpus of pre-annotated documents that contain annotations, the corpus of pre-annotated documents that contain annotations being stored on a machine-readable readable storage medium; sorting, with the one or more processors, the annotations contained in the corpus of pre-annotated documents, to generate good candidate annotations, the step of sorting comprising i) for each document in the corpus of pre-annotated documents, constructing within a graphical user interface a graph representing frequencies of instances of candidate annotations in each sentence, ii) for each document in the corpus of subject annotated documents, constructing within the graphical user interface an analogous graph superimposed on the graph from (i), wherein the analogous graph represents frequencies of instances of subject annotations, and iii) providing a visual comparison within the graphical user interface, on a per document basis, to the graph from (i) and the analogous graph from (ii) to identify the instances of the candidate annotations with correlation to the instances of the subject annotations; the method further comprises a decomposing step that comprises: modeling annotation expressions as a mapping from a corpus, document, sentence space to a span, tag space, wherein the modeling identifies, as equitagged spans, spans with a same value of a tag, a measure on the spans being represented as follows: Span S is represented as a union of non-intersecting intervals I k from a sentence associated with an annotation, and for each interval I k =[a k , a (k+1) ], where a i are coordinates (positions) within the document, the measure is defined as measure m(I k ) being |a (k+1) −a k |, and for the span the measure is defined as m(S)=·Σm(I k ); embedding the spans into a vector space of dimension greater or equal to a number of all possible spans for a sentence; mapping an annotation expression into a lattice of the possible expressions; extracting a basis on a set of all possible expressions (APE) by choosing as the basis on the set of all possible expressions (APE) a minimal set of elements from inclusion APE (IAPE), so that each expression E from APE may be represented as a union of elements from IAPE; and finding an expression of a subject equitagged Annotation in terms of the annotations in the corpus of pre-annotated documents that were inserted by said plurality of annotators and said aggregates of said plurality of annotators; and mapping, with the one or more processors, the subject annotator, the subject annotator being stored on a machine-readable storage medium.
5. The computer implemented method of claim 1 , wherein the step of providing aggregates comprises providing aggregates that can be created based on conditions including: (i) an input/output condition requiring compatibility at the type system level, because annotators can be aggregated only if they have such compatibility; and (ii) a semantic condition, requiring that the annotators be such that their aggregation is meaningful.