Consider a specific string as input.
APT works by allowing the
user to define a number of text processing functions that accept a
string and return a possibly modified string.
APT will loop,
"firing" applicable functions until either no more modifications
occur (idempotency), or a timeout occurs (this inherently avoids
some of the problems with the bad worse case running of certain
regular expressions we experienced on certain corpora).
specifies a dependency chart of functions and applicable functions
are those which have their dependencies met.