Papers with Copy
C3PO: A Lightweight Copying Mechanism for Translating Pseudocode to Code (2022.aacl-srw)
Copied to clipboard
| Challenge: | Existing low-code translators that translate pseudocode to code are expensive in terms of data and compute. |
| Approach: | They propose a lightweight alternative that exploits the property of code wherein most tokens can be simply copied from the pseudocode. |
| Outcome: | The proposed model reduces the computational cost and vocabulary sizes while reducing the computational costs and complexity. |
From Manuscripts to Archetypes through Iterative Clustering (L18-1)
Copied to clipboard
| Challenge: | philologists have since the beginnings of the age of print attempted to provide one textual representation of this variety using stemmata . stemmats are trees depicting the copy history (manuscripts = nodes, Copy processes = edges) |
| Approach: | They propose to use stemmata to extract the most likely common ancestor of all observed variants and then iteratively cluster them to create a single textual representation. |
| Outcome: | The proposed method uses trees depicting the copy history to find the base text which is most likely the latest common ancestor of all observed variants. |
CascadeFix: Multi-Location Program Repair via Cascading Planning and Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for automating program repair face insufficient bug dependency modeling and inadequate global repair planning when addressing semantically complex multi-location bugs. |
| Approach: | They propose a multi-location automatic repair method via cascading planning and generation . they propose to model dependencies among bugs and cluster them to ensure rationality . |
| Outcome: | The proposed method resolves 84 multi-location bugs, achieving a 31% improvement over current methods. |