Research map / Graph learning / Graph algorithms and clustering
AMR Parsing With Cache Transition Systems
Xiaochang Peng, Daniel Gildea, Giorgio Satta
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| increase cache size from 4 to 7 (ablation) | Cache transition system · AMR training graphs | graph coverage: 90% -> 99% | Improved |
| cache transition parser with simple features vs CAMR (github) actions and features | CAMR (github) · LDC2015E86 test | Smatch F1: 0.63 -> 0.64 | Improved |
| cache transition parser vs CAMR (full) with refined actions and extra features | CAMR (full) · LDC2015E86 test | Smatch F1: 0.66 -> 0.64 | Hurt |
Closest papers by meaning
- One SPRING to Rule Them Both: Symmetric AMR Semantic Parsing and Generation without a Complex Pipeline (AAAI 2021 · similarity 0.88)
- Dependency Parsing is More Parameter-Efficient with Normalization (NeurIPS 2025 · similarity 0.82)
- EPIC: Efficient Position-Independent Caching for Serving Large Language Models (ICML 2025 · similarity 0.82)
- SCBench: A KV Cache-Centric Analysis of Long-Context Methods (ICLR 2025 · similarity 0.81)
- Tracing Hyperparameter Dependencies for Model Parsing via Learnable Graph Pooling Network (NeurIPS 2024 · similarity 0.81)
- Graph Parsing Networks (ICLR 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
