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

Original language | English |
---|---|

Title of host publication | Intelligent Computer Mathematics - 9th International Conference, AISC 2008 - 15th Symposium, Calculemus 2008 - 7th International Conference, MKM 2008, Proceedings |

Pages | 415-429 |

Number of pages | 15 |

DOIs | |

Publication status | Published - Sep 10 2008 |

Event | 9th Int. Conf. Artificial Intelligence and Symbolic Computation, AISC 2008 - 15th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2008 - 7th Int. Conf. Mathematical Knowledge Management, MKM 2008 - Birmingham, United Kingdom Duration: Jul 28 2008 → Aug 1 2008 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 5144 LNAI |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 9th Int. Conf. Artificial Intelligence and Symbolic Computation, AISC 2008 - 15th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2008 - 7th Int. Conf. Mathematical Knowledge Management, MKM 2008 |
---|---|

Country | United Kingdom |

City | Birmingham |

Period | 7/28/08 → 8/1/08 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Intelligent Computer Mathematics - 9th International Conference, AISC 2008 - 15th Symposium, Calculemus 2008 - 7th International Conference, MKM 2008, Proceedings*(pp. 415-429). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5144 LNAI). https://doi.org/10.1007/978-3-540-85110-3_35

**Verification of mathematical formulae based on a combination of context-free grammar and tree grammar.** / Fujiyoshi, Akio; Suzuki, Masakazu; Uchida, Seiichi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Intelligent Computer Mathematics - 9th International Conference, AISC 2008 - 15th Symposium, Calculemus 2008 - 7th International Conference, MKM 2008, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5144 LNAI, pp. 415-429, 9th Int. Conf. Artificial Intelligence and Symbolic Computation, AISC 2008 - 15th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2008 - 7th Int. Conf. Mathematical Knowledge Management, MKM 2008, Birmingham, United Kingdom, 7/28/08. https://doi.org/10.1007/978-3-540-85110-3_35

}

TY - GEN

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

AU - Fujiyoshi, Akio

AU - Suzuki, Masakazu

AU - Uchida, Seiichi

PY - 2008/9/10

Y1 - 2008/9/10

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

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

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

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

U2 - 10.1007/978-3-540-85110-3_35

DO - 10.1007/978-3-540-85110-3_35

M3 - Conference contribution

SN - 3540851097

SN - 9783540851097

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 415

EP - 429

BT - Intelligent Computer Mathematics - 9th International Conference, AISC 2008 - 15th Symposium, Calculemus 2008 - 7th International Conference, MKM 2008, Proceedings

ER -