Towards a parser for mathematical formula recognition

Authors:
Amar Raja;Matthew Rayner;Alan Sexton;Volker Sorge
Affiliations:
School of Computer Science, University of Birmingham, UK;School of Computer Science, University of Birmingham, UK;School of Computer Science, University of Birmingham, UK;School of Computer Science, University of Birmingham, UK
Venue:
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Year:
2006

Citing 6
Cited 2

Digital Pattern Recognition by Moments

Journal of the ACM (JACM)
Optical Formula Recognition

ICDAR '97 Proceedings of the 4th International Conference on Document Analysis and Recognition
Understanding mathematical expressions from document images

ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2
Mathematics recognition using graph rewriting

ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 1) - Volume 1
INFTY: an integrated OCR system for mathematical documents

Proceedings of the 2003 ACM symposium on Document engineering
A database of glyphs for OCR of mathematical documents

MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management

Progressive structural analysis for dynamic recognition of on-line handwritten mathematical expressions

Pattern Recognition Letters
Restoring Natural Language as a Computerised Mathematics Input Method

Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the transfer of mathematical knowledge from paper to electronic form, the reliable automatic analysis and understanding of mathematical texts is crucial. A robust system for this task needs to combine low level character recognition with higher level structural analysis of mathematical formulas. We present progress towards this goal by extending a database-driven optical character recognition system for mathematics with two high level analysis features. One extends and enhances the traditional approach of projection profile cutting. The second aims at integrating the recognition process with graph grammar rewriting by giving support to the interactive construction and validation of grammar rules. Both approaches can be successfully employed to enhance the capabilities of our system to recognise and reconstruct compound mathematical expressions.