• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Probabilistic mathematical formula recognition using a 2D context-free graph grammar

      Thumbnail
      View / Download
      284.4 Kb
      Author
      Çelik, Mehmet
      Yanikoglu, B.
      Date
      2011
      Source Title
      2011 International Conference on Document Analysis and Recognition
      Publisher
      IEEE
      Pages
      161 - 166
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      137
      views
      119
      downloads
      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. © 2011 IEEE.
      Keywords
      2D-grammar
      OCR
      2D-grammar
      Graph grammar
      Handwriting recognition
      Mathematical equations
      Context sensitive grammars
      Graph theory
      Optical character recognition
      Formal languages
      Permalink
      http://hdl.handle.net/11693/28259
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/ICDAR.2011.41
      Collections
      • Department of Computer Engineering 1410
      Show full item record

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Parsing Turkish using the lexical functional grammar formalism 

        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 [11]. This work represents the first effort for wide-coverage syntactic parsing of Turkish. Our implementation is based on ...
      • Thumbnail

        Handwritten mathematical formula recognition using a statistical approach 

        Ç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 ...
      • Thumbnail

        The effects of ınductive and deductive approach on written output 

        Emre, Deniz (Bilkent University, 2015)
        The present study explored the effects of inductive grammar instruction and deductive grammar instruction on the acquisition of conditionals and relative clauses in three aspects: written production, i. e. grammar accuracy ...

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy