| Class | Description |
|---|---|
| PairEmit |
For each pair of tokens in a given document emit a count.
|
| PairEmitCombiner |
Assumes each key is a timeperiod split set of words ordered by single/pair words then by word order.
|
| PairEmitCounter |
The input to this reducer is ordered firstly by unary/pairs then within these sets by word
Given a particular time period, first read all unary counts and combine for each word
Then for all pairs, combine pair instances for a given pair then emit onces a new pair or the end is reached
Once the first non unary word is found, start counting for a particular word
|
| PairMutualInformation | |
| TokenPairCount |
A pair of strings with 2 distinct counts:
number of times the pair appears together in a document
|
| TokenPairKeyComparator |
Read a tokenpair and make sure the single words appear before the pair words
|
| TokenPairPartitioner | |
| TokenPairUnaryCount |
A Pair count with a unary count for each item of the pair.
|
| TokenPairValueGroupingComparator |
Read a tokenpair and make sure the single words appear before the pair words
|
| WritablePairEnum |
| Enum | Description |
|---|---|
| PairEnum |
Some statistics of pairs emitted
|