Ambiguity and constraint in mathematical expression recognition
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Symbol Recognition: Current Advances and Perspectives
GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Treatment of Diagrams in Document Image Analysis
Diagrams '00 Proceedings of the First International Conference on Theory and Application of Diagrams
Defining the Syntax and Semantics of Natural Visual Languages
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
ACM SIGGRAPH 2007 courses
Pattern Recognition Letters
Towards a web-based progressive handwriting recognition environment for mathematical problem solving
Expert Systems with Applications: An International Journal
Towards a parser for mathematical formula recognition
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Graph transformation in document image analysis: approaches and challenges
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
| Hi-index | 0.00 |
This paper describes the design and the first steps of implementation of Ofr (Optical Formula Recognition), a system for extracting and understanding mathematical expressions in printed documents. Our approach clearly separate OCR step, geometrical treatments and syntactic analysis. In this paper we focus on the third part: we define a class of context-sensitive graph grammars for mathematical formulas, study their properties and show how to remove their ambiguities (by adding contexts in rules) to define efficient parsing. This method is based on a ``critical pairs'' approach in the sense of Knuth-Bendix algorithm.