Proceedings of 3rd International Conference on Document Analysis and Recognition
DOI: 10.1109/icdar.1995.599026
|View full text |Cite
|
Sign up to set email alerts
|

Mathematics recognition using graph rewriting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 45 publications
(17 citation statements)
references
References 10 publications
0
16
0
Order By: Relevance
“…The earliest approach to recognizing symbol layout, by Anderson, is of this type: an operator tree is constructed top-down, and then a string representing the tree structure is synthesized bottom-up [5]. A number of different attributed grammar types have been used, including context-free string grammars [43] and graph grammars [58,87,137].…”
Section: Mathematical Content Interpretationmentioning
confidence: 99%
“…The earliest approach to recognizing symbol layout, by Anderson, is of this type: an operator tree is constructed top-down, and then a string representing the tree structure is synthesized bottom-up [5]. A number of different attributed grammar types have been used, including context-free string grammars [43] and graph grammars [58,87,137].…”
Section: Mathematical Content Interpretationmentioning
confidence: 99%
“…A more complicated grammar-based approach, graph grammar rewriting technique (Grbavec and Blostein, 1995;Lavirotte and Pottier, 1997;Raja et al, 2006), was proposed by first creating an initial graph using compass point directions from each symbol. Then, hand-crafted grammar rules are used to specify a graph fragment for matching and a non-terminal graph fragment for replacing it with.…”
Section: Related Workmentioning
confidence: 99%
“…For example, point size can be used to decide whether the configuration x i is a subscript (as in the expression x i y i ) or whether the spatial relationship is a byproduct of other operators (as in the expression a x i). As a result, the graph grammar uses simpler, more efficient interpretation strategies than are used in Grbavec's approach [GrBl95] discussed in Section 3. Lavirotte's work inspired the graph grammar used in the math recognition system by Smithies et al [SmNA01].…”
Section: Graph Grammar To Produce a Parse Treementioning
confidence: 98%