Ink-parser-parameter optimization

A computer-implemented system that generates an optimal group of ink-parser parameters, the system comprising:

• a plurality of evaluator modules;
• a searcher module that generates groups of parameters and sends the groups of parameters to the evaluator modules for evaluation;
• wherein, upon receiving the groups of parameters from the searcher module, the evaluator modules use the received groups of parameters to parse pages of handwritten ink to produce parsed results that the evaluator modules use to calculate evaluation-function values, which the evaluator modules send to the searcher module;
• wherein the searcher module makes a determination with respect to whether the evaluation-function values satisfy a convergence condition;
• wherein, if the evaluation-function values satisfy the convergence condition, an optimal group of parameters has been generated;
• and
• wherein, if the evaluation-function values do not satisfy the convergence condition, the searcher module generates one or more additional groups of parameters for evaluation by the evaluator modules.

A computer-readable medium having computer-executable instructions for selecting an optimal set of ink-parser parameters by performing steps comprising:

• (1) Generating an initial population P(0)={Ii(0)}i=1, . . . ,I, where Ii(0) is an individual, and set k=0;
• (2) Computing E(Ii(k)) i=1, . . . , I;
• (3) Sorting E(Ii(k), i=1, . . . , I, from large to small and assigning probabilities to the individuals according to their positions in the sequence;
• (4) Selecting two individuals from P(k) according to the selected individuals' probabilities;
• (5) Recombining the individuals to produce two off-springs Ĩ1 and Ĩ2;
• (6) Computing E(Ĩ1) and E(Ĩ2);
• (7) Adding Ĩ1 and Ĩ2 to a new population P(k+1);
• (8) Repeating steps (3) through (7) until the number of individuals in P(k+1) reaches I;
• (9) Replacing P(k) with P(k+1) except for a most favorable individual that has a highest evaluation value;
• (10) Computing k=k+1;
• (11) Repeating steps (3) through (10) until a maximum allowable number of iterations is reached;
• and
• (12) Generating an optimal set of ink-parser parameters by computing Popt=arg max1,εP E(Ii).