A string matching based algorithm for performance evaluation of mathematical expression recognition (Q746565): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Error detection, error correction and performance evaluation in on-line mathematical expression recognition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3651735 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2707395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Tree-to-Tree Correction Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank | |||
Normal rank | |||
Revision as of 21:39, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A string matching based algorithm for performance evaluation of mathematical expression recognition |
scientific article |
Statements
A string matching based algorithm for performance evaluation of mathematical expression recognition (English)
0 references
16 October 2015
0 references
mathematical expression recognition
0 references
performance evaluation
0 references
linear representation
0 references
Levenshtein edit distance
0 references
0 references
