Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Robust Subgraph Generation Improves Abstract Meaning Representation Parsing (1506.03139v1)

Published 10 Jun 2015 in cs.CL

Abstract: The Abstract Meaning Representation (AMR) is a representation for open-domain rich semantics, with potential use in fields like event extraction and machine translation. Node generation, typically done using a simple dictionary lookup, is currently an important limiting factor in AMR parsing. We propose a small set of actions that derive AMR subgraphs by transformations on spans of text, which allows for more robust learning of this stage. Our set of construction actions generalize better than the previous approach, and can be learned with a simple classifier. We improve on the previous state-of-the-art result for AMR parsing, boosting end-to-end performance by 3 F$_1$ on both the LDC2013E117 and LDC2014T12 datasets.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Keenon Werling (5 papers)
  2. Gabor Angeli (2 papers)
  3. Christopher Manning (7 papers)
Citations (52)

Summary

We haven't generated a summary for this paper yet.