An efficient syntactic approach to structural analysis of on-line handwritten mathematical expressions

摘要: Abstract Machine recognition of mathematical expressions is not trivial even when all the individual characters and symbols in an expression can be recognized correctly. In this paper, we propose to use definite clause grammar (DCG) as a formalism define set replacement rules for parsing expressions. With DCG, are only able concisely, but their definitions also readily executable form. However, DCG parser potentially inefficient due its frequent backtracking. Thus, some methods here increase efficiency process. Experiments done on commonly seen show that our proposed achieve quite satisfactory speedup, making more feasible real-world applications.