# All issues

The use of syntax trees in order to automate the correction of LaTeX documents

pdf (998K)  / List of references

The problem is to automate the correction of LaTeX documents. Each document is represented as a parse tree. The modified Zhang-Shasha algorithm is used to construct a mapping of tree vertices of the original document to the tree vertices of the edited document, which corresponds to the minimum editing distance. Vertex to vertex maps form the training set, which is used to generate rules for automatic correction. The statistics of the applicability to the edited documents is collected for each rule. It is used for quality assessment and improvement of the rules.

Keywords: automation, editing distance, LaTeX, lexeme, machine learning, metric, parse tree, regular expression, reinforcement learning, syntax tree, text analysis, token
Citation in English: Chuvilin K.V. The use of syntax trees in order to automate the correction of LaTeX documents // Computer Research and Modeling, 2012, vol. 4, no. 4, pp. 871-883
Citation in English: Chuvilin K.V. The use of syntax trees in order to automate the correction of LaTeX documents // Computer Research and Modeling, 2012, vol. 4, no. 4, pp. 871-883
DOI: 10.20537/2076-7633-2012-4-4-871-883
• . An efficient algorithm for ${mathrm{LaTeX}}$ documents comparing. // Computer Research and Modeling. 2015. — V. 7, no. 2. — P. 329.
Please note that citation information may be incomplete as it includes data from Crossref cited-by program partners only.

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the List of Russian peer-reviewed journals publishing the main research results of PhD and doctoral dissertations.

International Interdisciplinary Conference "Mathematics. Computing. Education"

The journal is included in the RSCI

Indexed in Scopus