Grammatical verification for mathematical formula recognition based on context-free tree grammar

Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

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. A linear monadic context-free tree grammar (LM-CFTG) is employed as a formal framework to define "well-formed" mathematical formulae. A cubic time parsing algorithm for LM-CFTGs is presented. For the purpose of practical evaluation, a verification system for mathematical OCR is developed, and the effectiveness of the system is demonstrated by using the ground-truthed mathematical document database InftyCDB-1 and a misrecognition database newly constructed for this study.

Original languageEnglish
Pages (from-to)279-298
Number of pages20
JournalMathematics in Computer Science
Volume3
Issue number3
DOIs
Publication statusPublished - May 1 2010

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Grammatical verification for mathematical formula recognition based on context-free tree grammar'. Together they form a unique fingerprint.

Cite this