RUS  ENG
Full version
JOURNALS // Computer Research and Modeling // Archive

Computer Research and Modeling, 2012 Volume 4, Issue 4, Pages 871–883 (Mi crm536)

This article is cited in 2 papers

MODELS IN PHYSICS AND TECHNOLOGY

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

K. V. Chuvilin

Moscow Institute of Physics and Technology (SU), 9 Institutskii per., Dolgoprudny, Moscow Region, 141700, Russia

Abstract: 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 statisticsof the applicability to the edited documents is collected for each rule. It is used for quality assessment andimprovement of the rules.

Keywords: automation, editing distance, LATEX, lexeme, machine learning, metric, parse tree, regular expression, reinforcement learning, syntax tree, text analysis, token.

UDC: 519.226

Received: 20.07.2012

DOI: 10.20537/2076-7633-2012-4-4-871-883



© Steklov Math. Inst. of RAS, 2026