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

Akio Fujiyoshi; Masakazu Suzuki; Seiichi Uchida

doi:10.1007/s11786-010-0023-8

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

Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida

Real world robotics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	279-298
Number of pages	20
Journal	Mathematics in Computer Science
Volume	3
Issue number	3
DOIs	https://doi.org/10.1007/s11786-010-0023-8
Publication status	Published - May 2010

All Science Journal Classification (ASJC) codes

Computational Mathematics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1007/s11786-010-0023-8

Cite this

@article{75c9f863244d4146bfe5fd619e928fbb,

title = "Grammatical verification for mathematical formula recognition based on context-free tree grammar",

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.",

author = "Akio Fujiyoshi and Masakazu Suzuki and Seiichi Uchida",

year = "2010",

month = may,

doi = "10.1007/s11786-010-0023-8",

language = "English",

volume = "3",

pages = "279--298",

journal = "Mathematics in Computer Science",

issn = "1661-8270",

publisher = "Birkhauser Verlag Basel",

number = "3",

}

TY - JOUR

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

AU - Fujiyoshi, Akio

AU - Suzuki, Masakazu

AU - Uchida, Seiichi

PY - 2010/5

Y1 - 2010/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77952881294&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952881294&partnerID=8YFLogxK

U2 - 10.1007/s11786-010-0023-8

DO - 10.1007/s11786-010-0023-8

M3 - Article

AN - SCOPUS:77952881294

SN - 1661-8270

VL - 3

SP - 279

EP - 298

JO - Mathematics in Computer Science

JF - Mathematics in Computer Science

IS - 3

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this