The DOI matches its Crossref record.
The Tree-to-Tree Correction Problem
Open accessAbstract
The tree-to-tree correctmn problem Is to determine, for two labeled ordered trees T and T', the distance from T to T' as measured by the mlmmum cost sequence of edit operaUons needed to transform T into T' The edit operations investigated allow changing one node of a tree into another node, deleting one node from a tree, or inserting a node into a tree An algorithm Is presented which solves this problem m time O(V* V'*LZ* L'2), where V and V' are the numbers of nodes respectively of T and T', and L and L' are the maximum depths respectively of T and T' Possible apphcatmns are to the problems of measuring the similarity between trees, automatic error recovery and correction for programming languages, and determining the largest common substructure of two trees KEY WORDS AND PHRASES tree correction, tree modification, tree similarity CR CATEGORIES 3 79, 4A2, 4 22, 5 23, 5 25 Edit Operations on Trees
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A survey on tree edit distance and related problems
Bille, P. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.030 · Cited by 751
Automated clustering and program repair for introductory programming assignments
Gulwani, S., Radiček, I., & Zuleger, F. (2018) · ACM SIGPLAN Notices · doi:10.1145/3296979.3192387 · Cited by 82
Evolution of the division of labor between genes and enzymes in the RNA world
Boza, G., Szilágyi, A., Kun, Á., Santos, M., & Szathmáry, E. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003936 · Cited by 36
Search, align, and repair: data-driven feedback generation for introductory programming exercises
Wang, K., Singh, R., & Su, Z. (2018) · ACM SIGPLAN Notices · doi:10.1145/3296979.3192384 · Cited by 17
Counterexample Guided Program Repair Using Zero-Shot Learning and MaxSAT-based Fault Localization
Orvalho, P., Janota, M., & Manquinho, V. (2025) · arXiv · doi:10.48550/arxiv.2502.07786 · Cited by 4
Metadata
- Authors
- Tai, K.-C.
- Venue
- Journal of the ACM
- Published
- 1979-07
- Volume
- 26
- Issue
- 3
- Pages
- 422-433
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1975009259
- Cited by
- 865
- References
- 0
- FWCI
- 0.98
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
