Automatic performance evaluation of mathematical expression recognition

The recognition of mathematical expression is very difficult. Most recognition methods are still tentative. In order to compare and improve them, it is necessary to evaluate their performances. However, the research on performance evaluation of mathematical expression recognition is very scarce. A triplet tree with marked edge is presented to represent the 2-D structure of mathematical expression. An automatic performance evaluation method, named BUTD (bottom-up and top-down), which is based on tree matching, is proposed. BUTD has been used during the research of an expression image recognition system. Also, BUTD is the only known method, which can find any errors of character segmentation, character recognition and expression analysis.