Name
Title | ||
|---|---|---|
Generation Of Hypergraphs From The N-Best Parsing Of 2d-Probabilistic Context-Free Grammars For Mathematical Expression Recognition |
Abstract | ||
|---|---|---|
We consider hypergraphs as a tool obtained with bi-dimensional Probabilistic Context-Free Grammars to compactly represent the result of the n-best parse trees for an input image that represents a mathematical expression. More specifically, in this paper we propose: i) an algorithm to compute the N-best parse trees from a 2D-PCFGs, ii) an algorithm to represent the n-best parse trees using a compact representation in the form of hypergraphs, and iii) a formal framework for the development of inference algorithms (inside and outside) and normalization strategies of hypergraphs. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ICPR48806.2021.9412273 | 2020 25TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR) |
Keywords | DocType | ISSN |
Mathematical expression recognition, Probabilistic Context-Free Grammars, N-best parse trees, Hypergraphs | Conference | 1051-4651 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ernesto Noya | 1 | 0 | 0.34 |
| Joan-Andreu Sánchez | 2 | 198 | 29.00 |
| Jose Miguel Benedí | 3 | 13 | 2.69 |