- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes CYKNN, a neural architecture that attempts to directly encode the classical Cocke–Younger–Kasami parsing algorithm into a trainable neural network. The authors use Holographic Reduced Representations to represent symbols, CYK tables, and grammar rules as matrices, and reformulate parts of the CYK dynamic-programming procedure as matrix multiplications and recurrent updates. The main idea is to directly shape a neural architecture using the structure of a known symbolic algorithm rather than requiring the model to rediscover the algorithm purely from data. The experiments use data generated from a simple synthetic grammar and compare CYKNN with finetuned and in-context-learning language models, together with several architectural and initialization variants. Overall, the paper presents a potentially interesting neuro-symbolic idea, but the current theoretical analysis, experimental validation, and presentation are insufficient to establish the claimed contribution.
Critical strengths
The main strength is the attempt to directly exploit the structure of a known symbolic algorithm when designing a neural architecture. Within the current synthetic setting, the ablation results also indicate that explicitly injected grammar structure is useful: CYKNN initialized with the correct grammar substantially outperforms the randomly initialized and non-context-free variants.
Critical weaknesses
-
The main conclusions go beyond what is supported by the current theoretical and experimental evidence Based on experiments with relatively simple synthetic grammars, the paper draws strong conclusions regarding the algorithmic learning capabilities of Transformers, memorization behavior, and the generality of the proposed approach. However, the current evidence is insufficient to support these claims. CYKNN explicitly incorporates the structure of the CYK algorithm and grammar priors, whereas the language models are required to generate complete CYK tables as serialized text. The two settings therefore differ substantially in inductive bias, task interface, output representation, and training procedure, making it difficult to attribute the observed performance differences directly to an inherent inability of Transformers to learn the algorithm. Moreover, the experiments are largely restricted to simple synthetic grammars, leaving it unclear whether the proposed method remains effective for more complex grammars, longer sequences, or realistic parsing tasks.
-
The manuscript has a low level of overall polish, with substantial presentation, figure, and formatting issues I read the paper several times and still found substantial parts of it difficult to follow. The manuscript contains numerous spelling errors, naming inconsistencies, problematic figure captions, and low-quality figure presentation. Several figures are poorly designed or labeled, and terminology and model names are used inconsistently, including the mixed use of CYKNN and CKYNN, along with multiple obvious typographical errors. These issues occur repeatedly throughout the manuscript and substantially affect its readability and overall presentation quality. In addition, the Limitations section appears on page 10 of the PDF and precedes the References, which appears to violate the nine-page main-text limit.
Questions for authors
The issues that I would like the authors to address are already described in the Critical Weaknesses section.