Probabilistic mathematical formula recognition using a 2D context-free graph grammar
2011 International Conference on Document Analysis and Recognition
161 - 166
Item Usage Stats
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. © 2011 IEEE.
Context sensitive grammars
Optical character recognition
Published Version (Please cite this version)http://dx.doi.org/10.1109/ICDAR.2011.41
Showing items related by title, author, creator and subject.
Güngördü, Z.; Oflazer, K. (Springer/Kluwer Academic Publishers, 1995)This paper describes our work on parsing Turkish using the lexical-functional grammar formalism . This work represents the first effort for wide-coverage syntactic parsing of Turkish. Our implementation is based on ...
Çelik, Mehmet; Yanıkoğlu, B. (IEEE, 2011-04)We present a probabilistic framework for a mathematical expression recognition system. The system is flexible in that its grammar can be extended easily, thanks to its graph grammar which eliminates the need for specifying ...
Özkural, Eray (Springer, Berlin, Heidelberg, 2011)We propose a long-term memory design for artificial general intelligence based on Solomonoff's incremental machine learning methods. We introduce four synergistic update algorithms that use a Stochastic Context-Free Grammar ...