Now showing items 1-5 of 5

    • Handwritten mathematical formula recognition using a statistical approach 

      Taninmasi, O.; Yanikoğlu, B. (IEEE, 2011)
      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 ...
    • Inducing translation templates with type constraints 

      Cicekli, I. (Springer, 2005)
      This paper presents a generalization technique that induces translation templates from a given set of translation examples by replacing differing parts in the examples with typed variables. Since the type of each variable ...
    • 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 ...
    • Probabilistic mathematical formula recognition using a 2D context-free graph grammar 

      Celik, M.; Yanikoglu, B. (2011)
      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 ...
    • Querying web metadata: Native score management and text support in databases 

      Özsoyoǧlu, G.; Altingövde, I. S.; Al-Hamdani, A.; Özel, S. A.; Ulusoy, Ö.; Özsoyoǧlu, Z. M. (Association for Computing Machinery, 2004)
      In this article, we discuss the issues involved in adding a native score management system to object-relational databases, to be used in querying Web metadata (that describes the semantic content of Web resources). The Web ...