A hierarchical and recursive model of mathematical expressions for automatic reading of mathematical documents

J. Y. Toumit, S. Garcia-Salicetti, H. Emptoz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We propose an original model for automatic reading of mathematical texts, founded on a recursive approach and a hierarchical view of the latter. This hierarchy in the text has been introduced by means of the notion of mathematical object, that we characterise by a set of definitions. A prior segmentation phase of mathematical objects in text is performed, using character matching techniques and propagating the labelling process of mathematical objects around "special characters" initially recognised. Complex and dynamical tree representations are proposed for mathematical expressions detected in the text, and a dynamical set of priority rules has been defined that guides this automatic process. Finally the recognition of the elementary objects obtained permits to achieve the encoding of a mathematical expression.

Original languageEnglish
Title of host publicationProceedings of the 5th International Conference on Document Analysis and Recognition, ICDAR 1999
PublisherIEEE Computer Society
Pages119-122
Number of pages4
ISBN (Electronic)0769503187
DOIs
Publication statusPublished - 1 Jan 1999
Externally publishedYes
Event5th International Conference on Document Analysis and Recognition, ICDAR 1999 - Bangalore, India
Duration: 20 Sept 199922 Sept 1999

Publication series

NameProceedings of the International Conference on Document Analysis and Recognition, ICDAR
ISSN (Print)1520-5363

Conference

Conference5th International Conference on Document Analysis and Recognition, ICDAR 1999
Country/TerritoryIndia
CityBangalore
Period20/09/9922/09/99

Fingerprint

Dive into the research topics of 'A hierarchical and recursive model of mathematical expressions for automatic reading of mathematical documents'. Together they form a unique fingerprint.

Cite this