This paper proposes a syntactic method for detection and correction of misrecognized mathematical formulae for a practical mathematical OCR system. Linear monadic context-free tree grammar (LM-CFTG) is employed as a formal framework to define syntactically acceptable mathematical formulae. For the purpose of practical evaluation, a verification system is… (More)
This paper proposes the use of a formal grammar for the verification of mathematical formulae for a practical mathematical OCR system. Like a C compiler detecting syntax errors in a source file, we want to have a verification mechanism to find errors in the output of mathematical OCR. Linear monadic context-free tree grammar (LM-CFTG) was employed as a… (More)
This study focuses on the class of string languages generated by TAGs. It examines whether the class of string languages can be generated by some epsilon-free grammars and by some lexicalized grammars. Utilizing spine grammars, this problem is solved positively. This result for spine grammars can be translated into the result for TAGs.