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: ICDAR, Beijing, China (Accepted/In Press)

There is a more recent version of this item available.

Preview

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

Abstract

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
Subjects:	UNSPECIFIED
ID Code:	16681
Deposited By:	Berrin Yanıkoğlu
Deposited On:	17 Aug 2011 10:43
Last Modified:	28 Dec 2011 21:30

Available Versions of this Item

Probabilistic mathematical formula recognition using a 2D context-free graph grammar. (deposited 17 Aug 2011 10:43) [Currently Displayed]
- Probabilistic mathematical formula recognition using a 2D context-free graph grammar. (deposited 28 Dec 2011 21:30)

Repository Staff Only: item control page