MST-based Visual Parsing of Online Handwritten Mathematical Expressions
Authors:
- Lei HuLHLei Hu
- Richard ZanibbiRZRichard Zanibbi
- 1 October 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21676445,p. 337-342
Abstract
We develop a Maximum Spanning Tree (MST) based parser using Edmonds' algorithm, which extracts an MST from a directed Line-of-Sight graph in two passes. First, symbols are segmented by grouping input strokes, and then symbols and symbol pair spatial relationships are labeled. The time complexity of our MST-based parsing is lower than the time complexity of CYK parsing with 2-D Context-Free grammars. Also, our MST-based parser obtains higher formula structure and expression rates than published techniques using CYK parsing when starting from valid symbols. This parsing technique could be extended to include n-grams or other language constraints, and might be used for other notations.Keywords
This publication has 21 references indexed in Scilit:
- A Bayesian model for recognizing handwritten mathematical expressionsPattern Recognition, 2015
- Recognition of online handwritten mathematical formulas using probabilistic SVMs and stochastic context free grammarsPattern Recognition Letters, 2015
- A global learning approach for an online handwritten mathematical expression recognition systemPattern Recognition Letters, 2014
- Recognition of on-line handwritten mathematical expressions using 2D stochastic context-free grammars and hidden Markov modelsPattern Recognition Letters, 2014
- A new approach for recognizing handwritten mathematics using relational grammars and fuzzy setsInternational Journal on Document Analysis and Recognition (IJDAR), 2012
- Recognition and retrieval of mathematical expressionsInternational Journal on Document Analysis and Recognition (IJDAR), 2011
- Automatic Labeling of Handwritten Mathematical Symbols via Expression Matching2011
- Input feature selection by mutual information based on Parzen windowIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Shape matching and object recognition using shape contextsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986