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

Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida

研究成果: ジャーナルへの寄稿学術誌査読

3 被引用数 (Scopus)

抄録

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.

本文言語英語
ページ(範囲)279-298
ページ数20
ジャーナルMathematics in Computer Science
3
3
DOI
出版ステータス出版済み - 5月 1 2010

!!!All Science Journal Classification (ASJC) codes

  • 計算数学
  • 計算理論と計算数学
  • 応用数学

フィンガープリント

「Grammatical verification for mathematical formula recognition based on context-free tree grammar」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル