Skip to main content
Conference Proceedings

Verification of mathematical formulae based on a combination of context-free grammar and tree grammar

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5144 LNAI 415-429
DOI: 10.1007/978-3-540-85110-3_35
14Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

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. Linear monadic context-free tree grammar (LM-CFTG) was employed as a formal framework to define "well-formed" mathematical formulae. For the purpose of practical evaluation, a verification system for mathematical OCR was developed, and the effectiveness of the system was demonstrated by using the ground-truthed mathematical document database INFTY CDB-1. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fujiyoshi, A., Suzuki, M., & Uchida, S. (2008). Verification of mathematical formulae based on a combination of context-free grammar and tree grammar. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5144 LNAI, pp. 415–429). https://doi.org/10.1007/978-3-540-85110-3_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free