edu.umd.cloud9.example.cooccur
Class ComputeCooccurrenceMatrixPairs
java.lang.Object
org.apache.hadoop.conf.Configured
edu.umd.cloud9.example.cooccur.ComputeCooccurrenceMatrixPairs
- All Implemented Interfaces:
- Configurable, Tool
public class ComputeCooccurrenceMatrixPairs
- extends Configured
- implements Tool
Implementation of the "pairs" algorithm for computing co-occurrence matrices from a large text
collection. This algorithm is described in Chapter 3 of "Data-Intensive Text Processing with
MapReduce" by Lin & Dyer, as well as the following paper:
Jimmy Lin. Scalable Language Processing Algorithms for the Masses: A Case Study in
Computing Word Co-occurrence Matrices with MapReduce. Proceedings of the 2008 Conference
on Empirical Methods in Natural Language Processing (EMNLP 2008), pages 419-428.
- Author:
- Jimmy Lin
|
Method Summary |
static void |
main(String[] args)
Dispatches command-line arguments to the tool via the ToolRunner. |
int |
run(String[] args)
Runs this tool. |
ComputeCooccurrenceMatrixPairs
public ComputeCooccurrenceMatrixPairs()
- Creates an instance of this tool.
run
public int run(String[] args)
throws Exception
- Runs this tool.
- Specified by:
run in interface Tool
- Throws:
Exception
main
public static void main(String[] args)
throws Exception
- Dispatches command-line arguments to the tool via the
ToolRunner.
- Throws:
Exception