Just a dummy template right now. TODO: move functionality in here.

Just a dummy class. TODO: move common functionality here.

A fairly thin wrapper around the APF XML data structures. http://www.ldc.upenn.edu/Catalog/docs/LDC2005T09/README also APF_V4_0_1.DTD though it's no

Do a regex substitution on a string and remember its alignments to the original. This class represents a string ready to have such a computation, as

Various NL analysis utilities, including ones wrapping Stanford subsystems and other misc stuff

For keeping track of statistics. Just keeps average, sum, min, max.

An implementation of the classic hungarian algorithm for the assignment problem. Copyright 2007 Gary Baker (GPL v3) @author gbaker Modified by pliang

A bounded set maintains at most K items. Keeps the ones with the highest values.

experimental, doesn't work well

The source of canonical objects when a non-interned object is presented to the interner. The default implementation is an identity map.

Handle NaN's and infinities separately.

<p> This utility class allows for initialization of all Java(tm) classes at startup to avoid initialization delays at an innapropriate time.</p> <

A useful class for doing a periodic task by polling to see if it's time. At the same time, keep track of total time elapsed.

progressively add pairwise equivalences to this data structure. internally, it builds the transitive closure.

Allows measuring precision and recall.

sparse feature vector, supporting some set-like semantics ... just for fun?

like analysis.FindMentions except use exclusively ACE's opinions of what the mentions are the tricky bits are figuring out how to reconcile ACE's ment

For identifying the genders of given names. Uses US Census data from http://www.census.gov/genealogy/names/dist.female.first http://www.census.gov/ge

Formatting class. I'm really lazy. D() is a family of default functions for formatting various types of objects.

For keeping track of statistics. Keeps all the data around (can be memory expensive).

(deprecated and unused) Implementation of Hal Daume's HAPNIS perl script for parsing the internal structure of names. (http://www.cs.utah.edu/~hal/HA

Maintains a two-way map between a set of objects and contiguous integers from 0 to the number of objects. Use get(i) to look up object i, and indexOf(

Canonicalizes objects. Given an object, the intern() method returns a canonical representation of that object, that is, an object which equals() the

The logging output has a tree structure, where each node is a line of output, and the depth of a node is its indent level. A run is the sequence of ch

A run is a sequence of lines of text, some of which are printed. Stores the state associated with a run.

The MapFactory is a mechanism for specifying what kind of map is to be used by some object. For example, if you want a Counter which is backed by an