Probabilistic mathematical formula recognition using a 2D context-free graph grammar

Çelik, Mehmet and Yanıkoğlu, Berrin (2011) Probabilistic mathematical formula recognition using a 2D context-free graph grammar. In: International Conference on Document Analysis and Recognition (ICDAR 2011), Beijing, China

This is the latest version of this item.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1109/ICDAR.2011.41


We present a probabilistic framework for the mathematical expression recognition problem. The developed system is flexible in that its grammar can be extended easily thanks to its graph grammar which eliminates the need for specifying rule precedence. It is also optimal in the sense that all possible interpretations of the expressions are expanded without making early commitments or hard decisions. In this paper, we give an overview of the whole system and describe in detail the graph grammar and the parsing process used in the system, along with some preliminary results on character, structure and expression recognition performances.

Item Type:Papers in Conference Proceedings
Uncontrolled Keywords:online, handwriting recognition, OCR, mathematical equation, 2D-grammar, graph grammar
ID Code:18656
Deposited By:Berrin Yanıkoğlu
Deposited On:28 Dec 2011 21:30
Last Modified:31 Jul 2019 09:56

Available Versions of this Item

Repository Staff Only: item control page