While the result from a word (see section 6) is
unsatisfactory, Tesseract attempts to improve the result
by chopping the blob with worst confidence from the
character classifier. Candidate chop points are found
from concave vertices of a polygonal approximation
[2] of the outline, and may have either another concave
vertex opposite, or a line segment. It may take up to 3
pairs of chop points to successfully separate joined characters from the ASCII set.